On the complexity of computing the diameter of a polytope
From MaRDI portal
Publication:1337144
DOI10.1007/BF01206636zbMath0824.68042MaRDI QIDQ1337144
Shang-Hua Teng, Alan M. Frieze
Publication date: 30 October 1994
Published in: Computational Complexity (Search for Journal in Brave)
52B05: Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
52B11: (n)-dimensional polytopes
90C05: Linear programming
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Cites Work