The following pages link to Geometry of cuts and metrics (Q5906765):
Displaying 50 items.
- Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices (Q263094) (← links)
- An algorithm for computing cutpoints in finite metric spaces (Q263276) (← links)
- There are no finite partial cubes of girth more than 6 and minimum degree at least 3 (Q268262) (← links)
- On the diameter of cut polytopes (Q271649) (← links)
- On cell matrices: a class of Euclidean distance matrices (Q275228) (← links)
- On the directed cut cone and polytope (Q281821) (← links)
- Hypercubes are determined by their distance spectra (Q290656) (← links)
- Zero-one completely positive matrices and the \(\mathcal A(R, S)\) classes (Q309116) (← links)
- Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors (Q314769) (← links)
- On rotational symmetries of drawings of coherent periodic graphs (Q324851) (← links)
- Realization of metric spaces as inverse limits, and bilipschitz embedding in \(L_1\) (Q352120) (← links)
- A computational study and survey of methods for the single-row facility layout problem (Q354626) (← links)
- Metrization of weighted graphs (Q368458) (← links)
- Positive definite metric spaces (Q369652) (← links)
- A polyhedral approach to the single row facility layout problem (Q378107) (← links)
- Distance covariance in metric spaces (Q378803) (← links)
- \(l_1\)-embeddability under the edge-gluing operation on graphs (Q390281) (← links)
- On the polyhedral structure of uniform cut polytopes (Q401136) (← links)
- Gap inequalities for non-convex mixed-integer quadratic programs (Q408381) (← links)
- Computing the Grothendieck constant of some graph classes (Q408441) (← links)
- Compression bounds for Lipschitz maps from the Heisenberg group to \(L_{1}\) (Q416849) (← links)
- A class of hypergraphs and vertices of cut polytope relaxations (Q416923) (← links)
- The walk distances in graphs (Q427888) (← links)
- Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
- The split decomposition of a \(k\)-dissimilarity map (Q432491) (← links)
- Complexity results for the gap inequalities for the max-cut problem (Q439900) (← links)
- A lexicographic semiorder polytope and probabilistic representations of choice (Q440019) (← links)
- Geometricity of genetic operators for real-coded representation (Q482440) (← links)
- Metric characterizations of superreflexivity in terms of word hyperbolic groups and finite graphs (Q483939) (← links)
- Voronoi polytopes for polyhedral norms on lattices (Q499359) (← links)
- On reduced semidefinite programs for second order moment bounds with applications (Q507337) (← links)
- A new approach to low-distortion embeddings of finite metric spaces into non-superreflexive Banach spaces (Q529376) (← links)
- From equipartition to uniform cut polytopes: extended polyhedral results (Q533779) (← links)
- Embedding into the rectilinear plane in optimal \(O(n^{2})\) time (Q533893) (← links)
- Flow metrics (Q596135) (← links)
- On a class of metrics related to graph layout problems (Q603106) (← links)
- The contact polytope of the Leech lattice (Q603877) (← links)
- Small bipartite subgraph polytopes (Q613319) (← links)
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances (Q628311) (← links)
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) (← links)
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
- Cut ideals of \(K_{4}\)-minor free graphs are generated by quadrics (Q654935) (← links)
- Bourgain's discretization theorem (Q692778) (← links)
- Infinite serie of extreme Delaunay polytopes (Q703611) (← links)
- Strict \(p\)-negative type of a metric space (Q707875) (← links)
- The graph bottleneck identity (Q719327) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope (Q740647) (← links)
- Delaunay and Voronoi polytopes of the root lattice \(E_{7}\) and of the dual lattice \(E^\ast_{7}\) (Q741165) (← links)
- On the extension complexity of combinatorial polytopes (Q745682) (← links)
