Approximation algorithms for capacitated partial inverse maximum spanning tree problem.
Xianyue LiZhao ZhangRuowang YangHeping ZhangDing-Zhu DuPublished in: J. Glob. Optim. (2020)
Keyphrases
- approximation algorithms
- network design problem
- np hard
- facility location problem
- minimum cost
- spanning tree
- special case
- worst case
- vertex cover
- np hardness
- set cover
- integrality gap
- scheduling problem
- open shop
- routing problem
- interval data
- primal dual
- approximation ratio
- randomized algorithms
- approximation schemes
- optimal solution
- lower bound
- precedence constraints
- network flow
- undirected graph
- lot sizing
- combinatorial auctions
- constant factor
- disjoint paths
- polynomial time approximation
- branch and bound algorithm
- constant factor approximation
- vehicle routing problem
- linear program
- computational complexity