MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Algorithms for Polytope Covering and Approximation, and for Approximate Closest-point Queries draft

Download:
Download as a PDF | Download as a PS
by Kenneth L. Clarkson
http://elib.zib.de/netlib/att/cs/doc/94/2-04.ps
Add To MetaCart

Abstract:

This paper gives an algorithm for polytope covering: let L and U be sets of points in R d, comprising n points altogether. A cover for L from U is a set C ae U with L a subset of the convex hull of C. Suppose c is the size of a smallest such cover, if it exists. The randomized algorithm given here finds a cover of size no more than c(5d ln c), for c large enough. The algorithm requires O(c 2

Citations

511 Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm – Littlestone - 1988
442 ªAn Optimal Algorithm for Approximate Nearest Neighbor Searching – Arya, Mount, et al. - 1994
345 Applications of random sampling in computational geometry – Clarkson - 1989
212 Skip lists: A probabilistic alternative to balanced trees – Pugh - 1990
188 Epsilon-nets and simplex range queries – Haussler, Welzl - 1987
139 On constructing minimum spanning trees in k-dimensional space and related problems – Yao - 1982
103 A new algorithm for minimizing convex functions over convex sets – Vaidya - 1996
80 Reporting points in halfspaces – Matousek - 1992
67 An algorithm for approximate closest-point queries – Clarkson - 1994
57 Approximate nearest neighbor queries in fixed dimensions – Arya, Mount - 1993
54 Metric entropy of some classes of sets with differentiable boundaries – Dudley - 1974
52 Algorithms for polytope covering and approximation – Clarkson - 1993
39 A Las Vegas algorithm for linear programming when the dimension is small – Clarkson - 1988
37 Linear optimization queries – Matousek - 1993
36 Partition trees for triangle counting and other range searching problems – Welzl - 1988
32 A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio. Math. Programming 61 – Adler, Shamir - 1993
21 Separation and approximation of polyhedral objects – Mitchell, Suri - 1995
20 Reporting points in halfspaces – Matouˇsek - 1992
7 Linear optimization queries – Matouˇsek, Schwarzkopf - 1992
5 The complexity of minimum nested polyhedra – Das, Joseph - 1990
View or Download | Add to My Collection | Correct Errors