Convex volume approximation (original) (raw)
In the analysis of algorithms, several authors have studied the computation of the volume of high-dimensional convex bodies, a problem that can also be used to model many other problems in combinatorial enumeration.Often these works use a black box model of computation in which the input is given by a subroutine for testing whether a point is inside or outside of the convex body, rather than by an explicit listing of the vertices or faces of a convex polytope.It is known that, in this model, no deterministic algorithm can achieve an accurate approximation, and even for an explicit listing of faces or vertices the problem is #P-hard.However, a joint work by Martin Dyer, Alan M. Frieze and Ravindran Kannan provided a randomized polynomial time approximation scheme for the problem,providing a
| Property | Value |
|---|---|
| dbo:abstract | In the analysis of algorithms, several authors have studied the computation of the volume of high-dimensional convex bodies, a problem that can also be used to model many other problems in combinatorial enumeration.Often these works use a black box model of computation in which the input is given by a subroutine for testing whether a point is inside or outside of the convex body, rather than by an explicit listing of the vertices or faces of a convex polytope.It is known that, in this model, no deterministic algorithm can achieve an accurate approximation, and even for an explicit listing of faces or vertices the problem is #P-hard.However, a joint work by Martin Dyer, Alan M. Frieze and Ravindran Kannan provided a randomized polynomial time approximation scheme for the problem,providing a sharp contrast between the capabilities of randomized and deterministic algorithms. The main result of the paper is a randomized algorithm for finding an approximation to the volume of a convex body in -dimensional Euclidean space by assuming the existence of a membership oracle. The algorithm takes time bounded by a polynomial in , the dimension of and .The algorithm combines two ideas: * By using a Markov chain Monte Carlo (MCMC) method, it is possible to generate points that are nearly uniformly randomly distributed within a given convex body. The basic scheme of the algorithm is a nearly uniform sampling from within by placing a grid consisting of -dimensional cubes and doing a random walk over these cubes. By using the theory of rapidly mixing Markov chains, they show that it takes a polynomial time for the random walk to settle down to being a nearly uniform distribution. * By using rejection sampling, it is possible to compare the volumes of two convex bodies, one nested within another, when their volumes are within a small factor of each other. The basic idea is to generate random points within the outer of the two bodies, and to count how often those points are also within the inner body. The given convex body can be approximated by a sequence of nested bodies, eventually reaching one of known volume (a hypersphere), with this approach used to estimate the factor by which the volume changes at each step of this sequence. Multiplying these factors gives the approximate volume of the original body. This work earned its authors the 1991 Fulkerson Prize. (en) |
| dbo:wikiPageID | 22721042 (xsd:integer) |
| dbo:wikiPageLength | 7313 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1102260072 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Volume dbr:Deterministic_algorithm dbc:Approximation_algorithms dbr:Analysis_of_algorithms dbr:Oracle_machine dbr:Convex_body dbr:Convex_polytope dbr:Martin_Dyer dbr:Fulkerson_Prize dbc:Computational_geometry dbr:Rejection_sampling dbr:Alan_M._Frieze dbr:Markov_chain_mixing_time dbr:Random_walk dbr:Ravindran_Kannan dbr:Klee's_measure_problem dbr:Markov_chain_Monte_Carlo dbr:Sharp-P-complete dbr:Polynomial_time_approximation_scheme dbr:Combinatorial_enumeration |
| dbp:wikiPageUsesTemplate | dbt:R dbt:Reflist |
| dct:subject | dbc:Approximation_algorithms dbc:Computational_geometry |
| rdfs:comment | In the analysis of algorithms, several authors have studied the computation of the volume of high-dimensional convex bodies, a problem that can also be used to model many other problems in combinatorial enumeration.Often these works use a black box model of computation in which the input is given by a subroutine for testing whether a point is inside or outside of the convex body, rather than by an explicit listing of the vertices or faces of a convex polytope.It is known that, in this model, no deterministic algorithm can achieve an accurate approximation, and even for an explicit listing of faces or vertices the problem is #P-hard.However, a joint work by Martin Dyer, Alan M. Frieze and Ravindran Kannan provided a randomized polynomial time approximation scheme for the problem,providing a (en) |
| rdfs:label | Convex volume approximation (en) |
| owl:sameAs | wikidata:Convex volume approximation https://global.dbpedia.org/id/4tS8V |
| prov:wasDerivedFrom | wikipedia-en:Convex_volume_approximation?oldid=1102260072&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Convex_volume_approximation |
| is dbo:wikiPageRedirects of | dbr:Approximating_the_volume_of_convex_bodies dbr:Polynomial-time_algorithm_for_approximating_the_volume_of_convex_bodies dbr:Polynomial_time_algorithm_for_approximating_the_volume_of_convex_bodies |
| is dbo:wikiPageWikiLink of | dbr:David_Applegate dbr:Volume dbr:Convex_polytope dbr:Approximating_the_volume_of_convex_bodies dbr:Klee's_measure_problem dbr:Polynomial-time_algorithm_for_approximating_the_volume_of_convex_bodies dbr:Polynomial_time_algorithm_for_approximating_the_volume_of_convex_bodies |
| is dbp:subDiscipline of | dbr:David_Applegate |
| is foaf:primaryTopic of | wikipedia-en:Convex_volume_approximation |