Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP.
Aaron ArcherMohammadHossein BateniMohammadTaghi HajiaghayiHoward J. KarloffPublished in: SIAM J. Comput. (2011)
Keyphrases
- approximation algorithms
- prize collecting
- np hard
- steiner tree
- special case
- vertex cover
- worst case
- minimum cost
- traveling salesman problem
- primal dual
- undirected graph
- approximation ratio
- constant factor approximation
- precedence constraints
- branch and bound algorithm
- combinatorial optimization
- optimal solution
- linear programming
- genetic algorithm
- travel time
- ant colony optimization
- facility location
- shortest path
- constant factor
- dynamic programming