- Sparsification and subexponential approximation
2016/10/12 by Édouard Bonnet, Vangélis Th. Paschos, Vangelis Th. Paschos · 1 citation
Computer Science · Mathematics · #Algorithm #Approximation algorithm #Combinatorics #Complexity and Algorithms in Graphs #Computation #Computer science #Cover (algebra) #Discrete mathematics #Dominating set #Error Correcting Code Techniques #Exponential function #Feedback vertex set #Graph #Independent set #Mathematics #Optimization and Search Problems #Order (exchange) #Set (abstract data type) #Set cover problem #Vertex (graph theory) #Vertex cover
- Truthful Mechanism Design for Multidimensional Covering Problems
2012/11/14 by Hadi Minooei, Minooei, Hadi, Chaitanya Swamy +1 · 1 citation
Computer Science · Decision Sciences · Economics, Econometrics and Finance · Mathematics · #Approximation algorithm #Artificial intelligence #Auction Theory and Applications #Class (philosophy) #Combinatorics #Computer Science and Game Theory (cs.GT) #Computer science #Cover (algebra) #Covering problems #Data Structures and Algorithms (cs.DS) #Dimension (graph theory) #Discrete mathematics #F.2.2 #FOS: Computer and information sciences #Facility location problem #G.2.2 #Graph #J.4 #Law, Economics, and Judicial Systems #Mathematical optimization #Mathematics #Optimization and Search Problems #Set (abstract data type) #Set cover problem #Vertex (graph theory) #cs.DS #cs.GT
- A better approximation ratio for the vertex cover problem
2009/10/01 by George Karakostas · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Approximation algorithm #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Cover (algebra) #Discrete mathematics #Graph #Mathematics #Maximum cut #Optimization and Search Problems #Relaxation (psychology) #Set (abstract data type) #Set cover problem #Vertex (graph theory) #Vertex cover
- Inapproximability Results for Guarding Polygons and Terrains
2001/09/01 by Stephan Eidenbenz, S. Eidenbenz, Christoph Stamm +3 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Approximation algorithm #Binary logarithm #Combinatorics #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Computer science #Discrete mathematics #Geometry #Graph #Guard (computer science) #Mathematics #Point in polygon #Polygon (computer graphics) #Regular polygon #Set (abstract data type) #Set cover problem #Simple polygon #Time complexity #Vertex (graph theory) #Vertex cover
- A threshold of ln n for approximating set cover
1998/07/01 by Uriel Feige · 183 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Approximation algorithm #Cardinality (data modeling) #Combinatorics #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Computer science #Cover (algebra) #Discrete mathematics #Greedy algorithm #Mathematics #Order (exchange) #Set (abstract data type) #Set cover problem
- Almost optimal set covers in finite VC-dimension
1995/12/01 by Hervé Brönnimann, H. Brönnimann, Michael T. Goodrich +1 · 1 citation
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
- Three-coloring the vertices of a triangulated simple polygon
1992/04/01 by Ali A. Kooshesh, A.A. Kooshesh, Bernard M. E. Moret +1 · 1 citation
Computer Science · Mathematics · #Algorithm #Computational Geometry and Mesh Generation #Computer Graphics and Visualization Techniques #Computer science #Cover (algebra) #Geography #Geometry #Mathematics #Observer (physics) #Polygon (computer graphics) #Regular polygon #Robotic Path Planning Algorithms #Set (abstract data type) #Set cover problem #Simple (philosophy) #Simple polygon #Terrain #Time complexity #Visibility
- On Path Cover Problems in Digraphs and Applications to Program Testing
1979/09/01 by Simeon Ntafos, S. L. Hakimi · 1 citation
Computer Science · Mathematics · #Software Testing and Debugging Techniques #Teaching and Learning Programming #Formal Methods in Verification #Cover (algebra) #Digraph #Path (computing) #Computer science #Set cover problem #Set (abstract data type) #Algorithm #Theoretical computer science #Combinatorics #Mathematics #Programming language