Image de couverture de livre

Robinson spaces and their representation in low-dimensional metric spaces

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Arrepol, Francisco, Soto-Gomez, Mauricio, Caro, Christopher Thraves
Format:	Preprint
Publié:	2026
Sujets:	Combinatorics 68R12, 90C90, 52-08
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

From linear programming to colliding particles
par: Black, Alexander E., et autres
Publié: (2024)

Lower bounds and integrality gaps in simplicial decomposition
par: Ellison, Matthew
Publié: (2024)

Binary Cyclic Transversal Polytopes
par: Frede, Jonas, et autres
Publié: (2024)

Critical moments of slices and slabs of the cube (and other polyhedral norms)
par: Brandenburg, Marie-Charlotte, et autres
Publié: (2026)

On 1-skeleton of the cut polytopes
par: Nikolaev, Andrei V.
Publié: (2024)

The Boolean polynomial polytope with multiple choice constraints
par: Shao, Sihong, et autres
Publié: (2024)

Degree Sequence Optimization and Extremal Degree Enumerators
par: Onn, Shmuel
Publié: (2024)

Circuit and Graver Walks and Linear and Integer Programming
par: Onn, Shmuel
Publié: (2024)

A Successive Refinement Algorithm for Tri-Level Stochastic Defender-Attacker Problems with Decision-Dependent Probability Distributions
par: Affar, Samuel, et autres
Publié: (2024)

Mixed-Integer Linear Optimization for Cardinality-Constrained Random Forests
par: Burgard, Jan Pablo, et autres
Publié: (2024)

Mixed-Integer Linear Optimization for Semi-Supervised Optimal Classification Trees
par: Burgard, Jan Pablo, et autres
Publié: (2024)

Many rays of the submodular cone
par: Loho, Georg, et autres
Publié: (2025)

On the convex hull of integer points above the hyperbola
par: Alcántara, David, et autres
Publié: (2025)

On cone partitions for the min-cut and max-cut problems with non-negative edges
par: Nikolaev, Andrei V., et autres
Publié: (2023)

Minimum bounding polytropes for estimation of max-linear Bayesian networks
par: Ferry, Kamillo
Publié: (2025)

Determining inscribability of polytopes via rank minimization based on slack matrices
par: Chen, Yiwen, et autres
Publié: (2025)

On the Circuit Diameter Conjecture for Counterexamples to the Hirsch Conjecture
par: Black, Alexander E., et autres
Publié: (2023)

Exponential Lower Bounds for Many Pivot Rules for the Simplex Method
par: Black, Alexander E.
Publié: (2024)

Unimodular polytopes and column number bounds on polytopal totally unimodular matrices via Seymour's decomposition theorem
par: Nill, Benjamin
Publié: (2024)

The Subspace Flatness Conjecture and Faster Integer Programming
par: Reis, Victor, et autres
Publié: (2023)

From approximate to exact integer programming
par: Dadush, Daniel, et autres
Publié: (2022)

Learning Minimally Rigid Graphs with High Realization Counts
par: Slyvka, Oleksandr, et autres
Publié: (2026)

Unimodality of the number of paths per length on polytopes: Examples, counter-examples, and central limit theorem
par: Juhnke, Martina, et autres
Publié: (2025)

The number of realisations of a random graph
par: Dewar, Sean, et autres
Publié: (2026)

Symmetric properties and two variants of shuffle-cubes
par: Lü, Huazhong, et autres
Publié: (2021)

Theoretical results for Perfect Location signed Roman domination problem
par: Nikolić, Bojan, et autres
Publié: (2025)

Tropical combinatorics of max-linear Bayesian networks
par: Améndola, Carlos, et autres
Publié: (2024)

Shapley-Folkman-type Theorem for Integrally Convex Sets
par: Murota, Kazuo, et autres
Publié: (2023)

Weighted domination models and randomized heuristics
par: Dijkstra, Lukas, et autres
Publié: (2022)

Reinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks
par: Heinz, Vilém, et autres
Publié: (2025)

A Matrix Optimization Method for Blind Extraction of External Equitable Partitions from Low Pass Graph Signals
par: Teng, Wenshun, et autres
Publié: (2025)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
par: Geremew, W., et autres
Publié: (2026)

Hardness and Structural Properties of Fuzzy Edge Contraction
par: Ali, Shanookha
Publié: (2025)

Two-edge-connected (not necessarily spanning) subgraphs and polyhedra
par: Bruckamp, Justus, et autres
Publié: (2024)

A greedy heuristic for graph burning
par: García-Díaz, Jesús, et autres
Publié: (2024)

Polytope Extensions with Linear Diameters
par: Kaibel, Volker, et autres
Publié: (2023)

A polynomial-time algorithm for deciding the Hilbert Nullstellensatz over $\mathbb{Z}_2$. A proof of $\mathbf{P}=\mathbf{NP}$ hypothesis
par: Petrov, Petar P.
Publié: (2022)

Lexicographic Extensions preserve Euclideaness
par: Hochstättler, Winfried, et autres
Publié: (2025)

Vertex-shellings of Euclidean Oriented Matroids
par: Hochstättler, Winfried, et autres
Publié: (2023)

Attempting the impossible: enumerating extremal submodular functions for n=6
par: Csirmaz, Elod P., et autres
Publié: (2024)