Approximation Algorithms for Time-Window TSP and Prize Collecting TSP Problems.
Jie GaoSu JiaJoseph S. B. MitchellLu ZhaoPublished in: WAFR (2016)
Keyphrases
- approximation algorithms
- np hard
- vertex cover
- traveling salesman problem
- optimization problems
- approximation schemes
- np hardness
- special case
- network design problem
- prize collecting
- combinatorial optimization
- randomized algorithms
- worst case
- genetic algorithm
- optimal solution
- approximation ratio
- linear programming
- knapsack problem
- branch and bound
- primal dual
- minimum cost
- combinatorial auctions
- scheduling problem
- video sequences