Almost optimal set covers in finite VC-dimension
- 1 December 1995
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 14 (4) , 463-479
- https://doi.org/10.1007/bf02570718
Abstract
No abstract availableKeywords
This publication has 40 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Reporting points in halfspacesComputational Geometry, 1992
- Cutting hyperplane arrangementsDiscrete & Computational Geometry, 1991
- On learning a union of half spacesJournal of Complexity, 1990
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985
- Approximation Algorithms for the Set Covering and Vertex Cover ProblemsSIAM Journal on Computing, 1982
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- On the density of families of setsJournal of Combinatorial Theory, Series A, 1972
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971