A bound on the \(k\)-gonality of facets of the hypermetric cone and related complexity problems
From MaRDI portal
Publication:1803268
DOI10.1016/0925-7721(93)90021-WzbMath0792.68056MaRDI QIDQ1803268
David Avis, Viatcheslav Grishukhin
Publication date: 29 June 1993
Published in: Computational Geometry (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Semidefinite programming and combinatorial optimization, Non-rigidity degree of a lattice and rigid lattices, Complexity results for the gap inequalities for the max-cut problem, Metric extensions and the \(L^ 1\) hierarchy, Application of cut polyhedra. I, Applications of cut polyhedra. II
Cites Work