volume 28, issue 3, P349-377 2002
DOI: 10.1007/s00454-002-0745-8
View full text
|
|
Share

Abstract: The problem of finding a d-simplex of maximum volume in an arbitrary ddimensional V -polytope, for arbitrary d, was shown by Gritzmann et al. [GKL] in 1995 to be NP-hard. They conjectured that the corresponding problem for H -polytopes is also NPhard. This paper presents a unified way of proving the NP-hardness of both these problems. The approach also yields NP-hardness proofs for the problems of finding d-simplices of minimum volume containing d-dimensional V -or H -polytopes. The polytopes that play the k…

Expand abstract

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
13
0
1

Publication Types

Select...

Relationship

0
0

Authors

Journals