Approximation algorithms for tours of height-varying view cones.
Patrick A. PlonskiVolkan IslerPublished in: Int. J. Robotics Res. (2019)
Keyphrases
- approximation algorithms
- minimum cost
- special case
- np hard
- worst case
- primal dual
- network design problem
- facility location problem
- open shop
- vertex cover
- set cover
- approximation ratio
- np hardness
- randomized algorithms
- constant factor
- exact algorithms
- approximation schemes
- constant factor approximation
- network flow
- traveling salesman problem
- disjoint paths