Fast LP-based approximations for geometric packing and covering problems

Keyphrases

• Side Constraints 100%
• Packing Problem 100%
• Geometric Packing 100%
• Covering Problem 100%
• Geometric Covering 100%
• Mixed Packing 100%
• Approximation Scheme 50%
• Fast Approximation 50%
• Geometry Optimization 50%
• Optimization Problem 50%
• Computational Geometry 50%
• Oracle 50%
• Approximation Bound 50%
• Emptiness 50%
• Constant-factor Approximation Algorithm 50%
• LP Relaxation 50%
• Range Space 50%
• Dynamic Data Structures 50%
• Rounding Algorithm 50%
• Geometric Data Structures 50%
• Nearly-linear Time 50%

Computer Science

• Approximation (Algorithm) 100%
• Data Structure 100%
• Side Constraint 100%
• Optimization Problem 50%
• Approximation Algorithms 50%
• Constant Factor 50%
• Computational Geometry 50%
• approximation scheme 50%
• Rounding Algorithm 50%

Mathematics

• Data Structure 100%
• Rounding 100%
• Covering Problem 100%
• Approximates 50%
• Linear Time 50%
• Constant Factor 50%