Universal approximations for TSP, Steiner tree, and set cover.
Lujun JiaGuolong LinGuevara NoubirRajmohan RajaramanRavi SundaramPublished in: STOC (2005)
Keyphrases
- set cover
- steiner tree
- np hard
- traveling salesman problem
- minimum spanning tree
- greedy algorithm
- approximation algorithms
- greedy heuristics
- network flow
- greedy heuristic
- solution space
- shortest path
- ant colony optimization
- facility location
- search space
- integer programming
- optimal solution
- special case
- worst case
- genetic algorithm
- convex hull
- primal dual
- combinatorial optimization
- linear programming relaxation
- dynamic programming
- scheduling problem
- knapsack problem
- connected components
- metaheuristic
- random walk
- linear programming
- optimization problems
- training set
- lower bound
- reinforcement learning
- social networks