A bound on the k-gonality of facets of the hypermetric cone and related complexity problems

13Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We give a bound on gh(n), the largest integer such that there is a gh(n)-gonal facet of the hypermetric cone Hypn, gh(n) ≤ 2n-2 (n-1)! This proves simultaneously the polyhedrality of the hypermetric cone. We give complete description of Delaunay polytopes related to facets of Hypn. We prove that the problem determining hypermetricity lies in co-NP and give some related NP-hard problem. © 1993.

Cite

CITATION STYLE

APA

Avis, D., & Grishukhin, V. P. (1993). A bound on the k-gonality of facets of the hypermetric cone and related complexity problems. Computational Geometry: Theory and Applications, 2(5), 241–254. https://doi.org/10.1016/0925-7721(93)90021-W

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free