On the geometric priority set cover problem

Keyphrases

• APX-hardness 33%
• Arbitrary Sizes 33%
• Capacitated Set Cover Problem 33%
• Constant-factor Approximation Algorithm 66%
• General Graphs 33%
• Geometric Set Systems 33%
• Half-space 33%
• Local Search 33%
• Local Search Algorithm 33%
• Orthants 33%
• Planar Support 33%
• Quasi-uniform 33%
• Set Covering Problem 100%
• Set Systems 33%
• Uniform Sampling 33%
• Unit Disk 100%
• Unit Square 33%
• Vertex Cover Problem 33%

Mathematics

• Constant Factor 66%
• Local Search 66%
• Search Algorithm 33%
• Unit Disk 100%
• Unit Square 33%