Abstract | ||
---|---|---|
With focus on the case of variable dimension n, this paper is concerned with deterministic polynomial-time approximation of the maximum j-measure of j-simplices contained in a given n-dimensional convex body K. Under the assumption that K is accessible only by means of a weak separation oracle, upper and lower bounds on the accuracy of oracle-polynomial-time approximations are obtained. |
Year | DOI | Venue |
---|---|---|
2000 | 10.1016/S0012-365X(99)00387-8 | Discrete Mathematics |
Keywords | Field | DocType |
oracle-polynomial-time approximation,algorithmic theory of convex bodies,polynomial time,simplex,largest simplex,05b20,90c30,68q20,determinant,oracle,52b55,approximation,convex body,15a15,upper and lower bounds | Discrete mathematics,Combinatorics,Convex body,Convex combination,Convex hull,Convex set,Subderivative,Convex polytope,Mathematics,Convex analysis,Mixed volume | Journal |
Volume | Issue | ISSN |
221 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
5 | 0.54 | 0 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Andreas Brieden | 1 | 43 | 5.11 |
Peter Gritzmann | 2 | 412 | 46.93 |
Victor Klee | 3 | 169 | 17.23 |