Approximation Algorithms for Tours of Orientation-Varying View Cones.
Nikolaos StefasPatrick A. PlonskiVolkan IslerPublished in: ICRA (2018)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- vertex cover
- worst case
- facility location problem
- primal dual
- exact algorithms
- network design problem
- open shop
- disjoint paths
- undirected graph
- np hardness
- approximation schemes
- precedence constraints
- combinatorial auctions
- traveling salesman problem
- approximation guarantees
- linear program
- branch and bound algorithm
- set cover