Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem.
Jianping LiSuding LiuJunran LichenWencheng WangYujie ZhengPublished in: J. Comb. Optim. (2020)
Keyphrases
- approximation algorithms
- minimum cost
- constant factor
- np hard
- special case
- quadratic program
- worst case
- vertex cover
- network design problem
- facility location problem
- set cover
- primal dual
- approximation ratio
- open shop
- strongly np hard
- randomized algorithms
- approximation schemes
- prize collecting
- exact algorithms
- network flow
- spanning tree
- combinatorial optimization
- euclidean distance
- np hardness
- precedence constraints
- integer programming
- linear programming
- genetic algorithm