Almost optimal set covers in finite VC-dimension

Almost optimal set covers in finite VC-dimension

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Herve Brönnimann , Michael T. Goodrich

Citations:

132 - 5 self

BibTeX

@MISC{Brönnimann_almostoptimal,
    author = {Herve Brönnimann and Michael T. Goodrich},
    title = {Almost optimal set covers in finite VC-dimension},
    year = {}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

8879	Computers and Intractability: A guide to the Theory of NP-Completeness - Garey, Johnson - 1979
7320	Introduction to Algorithms - CORMEN, LEISERSON, et al. - 1985
1611	Computational Geometry. An Introduction - Preparata, Shamos - 1985
1117	Reducibility among combinatorial problems - Karp
605	Learning quickly when irrelevant attributes abound: A new linear threshold algorithm - Littlestone - 1988
577	Approximation algorithms for combinatorial problems - Johnson - 1974
557	Data structures and network algorithms - Tarjan - 1983
356	Applications of random sampling in computational geometry - Clarkson, Shor
335	On the Hardness of Approximating Minimization Problems - Lund, Yannakakis - 1994
303	A greedy heuristic for the set-covering problem - Chvatal - 1979
239	Epsilon-nets and simplex range queries - Haussler, Welzl - 1987
217	On the ratio of optimal integral and fractional covers - Lovász - 1975
205	On the density of families of sets - Sauer - 1972
186	Training a 3-node neural networks is np-complete - Blum, Rivest - 1992
161	Efficient probabilistically checkable proofs and applications to approximations - Bellare, Goldwasser, et al. - 1993
158	Approximation schemes for covering and packing problems in image processing and VLSI - Hochbaum, Maas
106	Approximation algorithms for the set covering and vertex cover problems - Hochbaum - 1982
96	A deterministic view of random sampling and its use in geometry, Combinatorica 10 - Chazelle, Friedman - 1990
76	Cutting hyperplanes for divide-and-conquer - Chazelle - 1993
76	On linear-time deterministic algorithms for optimization problems in fixed dimensions - Chazelle, Matousek - 1996
71	Efficient partition trees - Matoušek - 1992
65	Reporting points in halfspaces - MATOUSEK - 1991
64	Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension - Blumer, Ehrenfeucht, et al. - 1988
56	Algorithms for polytope covering and approximation - Clarkson - 1993
50	Quasi-optimal range searching in spaces of finite VC-dimension - Chazelle, Welzl - 1989
48	Approximations and optimal geometric divide-and-conquer - Matousek - 1991
48	Range searching with efficient hierarchical cuttings - Matoušek - 1993
44	Product Range Spaces, Sensitive Sampling, and Derandomization - Brönnimann, Chazelle, et al. - 1999
38	Partition trees for triangle counting and other range searching problems - Welzl - 1988
35	A Las Vegas algorithm for linear programming when the dimension is small - Clarkson - 1988
32	Efficient NC algorithms for set cover with applications to learning and geometry - Berger, Rompel, et al.
31	Cutting hyperplane arrangements - Matousek - 1991
29	Separation and approximation of polyhedral surfaces - Mitchell, Suri - 1992
27	Geometric partitioning made easier, even in parallel.In Proc. 9th Annu - Goodrich - 1993
25	S.: Decision trees for geometric models - Arkin, Meijer, et al. - 1998
23	An optimal convex hull algorithm and new results on cuttings - Chazelle - 1991
17	Densité et dimension - Assouad - 1983
17	Primal-dual rnc approximation algorithms for (multi)set (multi)cover and covering integer programs - Rajagopalan, Vazirani - 1998
11	Construction of ffl-nets - Matousek - 1990
8	On learning a union of halfspaces - Baum - 1990
7	Discrepancy and ffl-approximations for bounded VCdimension - Matousek, Welzl, et al.
5	Approximation schemes in computational geometry - Das - 1990
5	Almost tight bounds for ffl-nets - Koml'os, Pach, et al. - 1992
5	How to net a lot with little: small ffl-nets for disks and halfspaces - Matousek, Seidel, et al. - 1990
4	On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab - Cervonenkis - 1971
4	Improved bounds on weak ffl-nets for convex sets - Chazelle, Edelsbrunner, et al. - 1993
3	Improved bounds on weak "-nets for convex sets - Chazelle, Edelsbrunner, et al. - 1993
3	Construction of "-nets - Matousek - 1990
2	Almost optimal polyhedral separators (video - Bronnimann - 1994
2	An implementation of Min Hitting Set heuristics - Bronnimann - 1994