Parameterized and Approximation Algorithms for Coverings Points with Segments in the Plane.
Katarzyna Anna KowalskaMichal PilipczukPublished in: STACS (2024)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- facility location problem
- approximation ratio
- randomized algorithms
- straight line segments
- network design problem
- set cover
- polygonal approximation
- np hardness
- constant factor
- boundary points
- primal dual
- point sets
- line segments
- exact algorithms
- combinatorial auctions
- approximation schemes
- upper bound
- polynomial time approximation
- open shop