Parameterized and approximation algorithms for coverings points with segments in the plane.
Katarzyna Anna KowalskaMichal PilipczukPublished in: CoRR (2024)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- facility location problem
- network design problem
- primal dual
- minimum cost
- open shop
- approximation ratio
- set cover
- exact algorithms
- straight line segments
- point sets
- line segments
- polygonal approximation
- feature points
- undirected graph
- combinatorial auctions
- np hardness
- constant factor
- approximation schemes
- euclidean geometry
- precedence constraints
- data points
- boundary points
- polynomial time approximation
- resource allocation
- disjoint paths
- genetic algorithm