Approximation Algorithms for the Two-Watchman Route in a Simple Polygon.
Bengt J. NilssonEli PackerPublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- simple polygon
- convex hull
- endpoints
- special case
- np hard
- medial axis
- worst case
- vertex cover
- minimum cost
- set cover
- approximation schemes
- road network
- open shop
- approximation ratio
- undirected graph
- travel time
- primal dual
- constant factor
- randomized algorithms
- shortest path
- precedence constraints
- approximation guarantees
- optimal solution
- combinatorial optimization
- disjoint paths
- search algorithm