Approximation Algorithms for Tours of Height-varying View Cones.
Patrick A. PlonskiVolkan IslerPublished in: WAFR (2016)
Keyphrases
- approximation algorithms
- minimum cost
- np hard
- special case
- worst case
- vertex cover
- open shop
- approximation schemes
- traveling salesman problem
- network design problem
- precedence constraints
- constant factor
- approximation ratio
- np hardness
- disjoint paths
- exact algorithms
- primal dual
- undirected graph
- combinatorial auctions
- scheduling problem
- vehicle routing
- computational complexity