Approximation algorithms for tours of orientation-varying view cones.
Nikolaos StefasPatrick A. PlonskiVolkan IslerPublished in: Int. J. Robotics Res. (2020)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- vertex cover
- worst case
- facility location problem
- network design problem
- constant factor
- np hardness
- exact algorithms
- approximation schemes
- open shop
- set cover
- approximation ratio
- primal dual
- traveling salesman problem
- precedence constraints
- approximation guarantees
- randomized algorithms
- optimal solution
- scheduling problem