The following pages link to Geometry of cuts and metrics (Q5906765):
Displayed 50 items.
- Flow metrics (Q596135) (← links)
- Infinite serie of extreme Delaunay polytopes (Q703611) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- On the structure of the tight-span of a totally split-decomposable metric (Q820090) (← links)
- Toric geometry of cuts and splits (Q841562) (← links)
- Finite metrics in switching classes (Q858301) (← links)
- A group majorization ordering for Euclidean distance matrices (Q861025) (← links)
- How to compute the rank of a Delaunay polytope (Q872032) (← links)
- Lattice Delone simplices with super-exponential volume (Q872037) (← links)
- Partial cubes and their \(\tau\)-graphs (Q875040) (← links)
- Transitive actions of finite Abelian groups of sup-norm isometries (Q875054) (← links)
- Compressed polytopes and statistical disclosure limitation (Q875709) (← links)
- Enhanced negative type for finite metric trees (Q924649) (← links)
- Embedding into \(l_{\infty }^{2}\) is easy, embedding into \(l_{\infty}^{3}\) is NP-complete (Q938314) (← links)
- Cubical token systems (Q943579) (← links)
- Media theory: Representations and examples (Q947060) (← links)
- The 22 minimal dichotomy decompositions of the \(K_5\)-distance (Q947066) (← links)
- Correctness criteria for algebraic closures of the estimate-calculating algorithm model (Q954216) (← links)
- Partial cubes: Structures, characterizations, and constructions (Q998441) (← links)
- A study of the quadratic semi-assignment polytope (Q1013294) (← links)
- The decomposition of the hypermetric cone into \(L\)-domains (Q1024277) (← links)
- Subdivided graphs as isometric subgraphs of Hamming graphs (Q1024304) (← links)
- Optimal realizations of generic five-point metrics (Q1024315) (← links)
- A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
- Asymmetric distances, semidirected networks and majority in Fermat-Weber problems (Q1026590) (← links)
- A prolongation-projection algorithm for computing the finite real variety of an ideal (Q1029340) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- Antipodal metrics and split systems (Q1348745) (← links)
- Semidefinite programming in combinatorial optimization (Q1365053) (← links)
- Cuts, matrix completions and graph rigidity (Q1365058) (← links)
- Interval routing in some planar networks. (Q1401175) (← links)
- Isometric embeddings of subdivided wheels in hypercubes (Q1402086) (← links)
- Cubic inflation, mirror graphs, regular maps, and partial cubes (Q1422394) (← links)
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (Q1569939) (← links)
- Decomposition and \(l_1\)-embedding of weakly median graphs (Q1582477) (← links)
- Quasi-semi-metrics, oriented multi-cuts and related polyhedra (Q1582485) (← links)
- Uniform partitions of 3-space, their relatives and embedding (Q1582487) (← links)
- A classification of the six-point prime metrics (Q1582489) (← links)
- Fullerenes and coordination polyhedra versus half-cube embeddings (Q1584443) (← links)
- Relaxation optical bistability: A new class of optically bistable elements (Q1595496) (← links)
- Clusters of cycles (Q1602420) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- Euclidean quotients of finite metric spaces (Q1763640) (← links)
- \(M\)-convex functions and tree metrics (Q1764353) (← links)
- On simplicial and cubical complexes with short links (Q1769171) (← links)
- Small cones of \(m\)-hemimetrics (Q1772270) (← links)
- The six-dimensional Delaunay polytopes (Q1826970) (← links)
- Least-distortion Euclidean embeddings of graphs: Products of cycles and expanders (Q1850474) (← links)
- Infinite series of extreme Delaunay polytopes (Q2368707) (← links)
- Characterizations of pseudo-codewords of (low-density) parity-check codes (Q2370162) (← links)