Pages that link to "Item:Q3984283"
From MaRDI portal
The following pages link to The cut cone,L1 embeddability, complexity, and multicommodity flows (Q3984283):
Displayed 26 items.
- Compression bounds for Lipschitz maps from the Heisenberg group to \(L_{1}\) (Q416849) (← links)
- Embedding into the rectilinear plane in optimal \(O(n^{2})\) time (Q533893) (← links)
- Finite metrics in switching classes (Q858301) (← links)
- Embedding into \(l_{\infty }^{2}\) is easy, embedding into \(l_{\infty}^{3}\) is NP-complete (Q938314) (← links)
- A bounded compactness theorem for \(L^ 1\)-embeddability of metric spaces in the plane (Q1196200) (← links)
- Facets for the cut cone. I (Q1199749) (← links)
- Facets for the cut cone. II: Clique-web inequalities (Q1199750) (← links)
- The hypermetric cone is polyhedral (Q1316645) (← links)
- Collapsing and lifting for the cut cone (Q1322220) (← links)
- Metric extensions and the \(L^ 1\) hierarchy (Q1332439) (← links)
- Fullerenes and coordination polyhedra versus half-cube embeddings (Q1584443) (← links)
- A bound on the \(k\)-gonality of facets of the hypermetric cone and related complexity problems (Q1803268) (← links)
- Hypercube embedding of generalized bipartite metrics (Q1842652) (← links)
- Application of cut polyhedra. I (Q1891019) (← links)
- Applications of cut polyhedra. II (Q1891020) (← links)
- Graphic vertices of the metric polytope (Q1916387) (← links)
- \(L_ 1\)-embeddability of rectilinear polygons with holes (Q1919299) (← links)
- New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities (Q2381532) (← links)
- The complexity of LSH feasibility (Q2440169) (← links)
- Generating facets for the cut polytope of a graph by triangular elimination (Q2465651) (← links)
- Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Q2848995) (← links)
- On Flattenability of Graphs (Q3452282) (← links)
- Threshold Dynamics for Networks with Arbitrary Surface Tensions (Q5247410) (← links)
- The projected pairwise multicommodity flow polyhedron (Q5938940) (← links)
- Approximation algorithms for feasible cut and multicut problems (Q6102317) (← links)
- Tail-dependence, exceedance sets, and metric embeddings (Q6144816) (← links)