Approximation algorithms for solving the line-capacitated minimum Steiner tree problem.
Jianping LiWencheng WangJunran LichenSuding LiuPengxiang PanPublished in: J. Glob. Optim. (2022)
Keyphrases
- approximation algorithms
- np hard
- minimum cost
- network design problem
- facility location problem
- constant factor
- special case
- vertex cover
- quadratic program
- worst case
- primal dual
- np hardness
- set cover
- randomized algorithms
- lower bound
- strongly np hard
- approximation ratio
- optimal solution
- constant factor approximation
- multi item
- open shop
- facility location
- spanning tree
- lot sizing
- combinatorial optimization
- linear programming
- scheduling problem
- disjoint paths
- network flow
- knapsack problem
- computational complexity
- search algorithm