Hervé Brönnimann
- Almost optimal set covers in finite VC-dimension
1995/12/01 by Hervé Brönnimann, H. Brönnimann, Michael T. Goodrich +1 · 4 citations
Computer Science · Engineering · Mathematics · #Advanced Numerical Analysis Techniques #Algorithm #Approximation algorithm #Binary logarithm #Combinatorics #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Computational complexity theory #Computational geometry #Computer science #Constant (computer programming) #Cover (algebra) #Dimension (graph theory) #Discrete mathematics #Finite set #Geometry #Greedy algorithm #Mathematical analysis #Mathematics #Polytope #Set (abstract data type) #Set cover problem #Time complexity #Upper and lower bounds #VC dimension