Near-linear approximation algorithms for geometric hitting sets

Keyphrases

• Linear Approximation 100%
• Hitting Set Problem 100%
• Geometric Hitting Set 100%
• Approximation Factor 50%
• Approximation Algorithms 50%
• Polynomial Time 50%
• Rectangle 50%
• Finite Sets 50%
• Time Approximation 50%
• N-factor 50%
• Cardinality 50%
• Set Systems 50%
• DSPACE 50%
• Near-linear Time 50%
• Union Complexity 50%
• Computable 50%
• Parallel Axes 50%
• Planar Region 50%

Mathematics

• Hitting Set 100%
• Linear Approximation 100%
• Empty Intersection 33%
• Polynomial Time 33%
• Linear Time 33%
• Finite Set 33%
• Dimensional Space 33%
• Cardinality 33%