论文信息 - On the complexity of computing the diameter of a polytope

On the complexity of computing the diameter of a polytope

We show that it isDP-hard to determine the combinatorial diameter of a polytope specified by linear inequalities with integer data. Our result partially resolves a long-term open question.

Alan M. Frieze | Shang-Hua Teng

[1] G. Kalai,et al. A quasi-polynomial bound for the diameter of graphs of polyhedra , 1992, math/9204233.

[2] V. Klee. Polytope pairs and their relationship to linear programming , 1974 .

[3] D. Larman. Paths on Polytopes , 1970 .

[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5] Mihalis Yannakakis,et al. The complexity of facets (and some facets of complexity) , 1982, STOC '82.

[6] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..