Approximation Algorithms for the Min-Max Cycle Cover Problem With Neighborhoods.
Lijia DengWenzheng XuWeifa LiangJian PengYingjie ZhouLei DuanSajal K. DasPublished in: IEEE/ACM Trans. Netw. (2020)
Keyphrases
- min max
- approximation algorithms
- np hard
- vertex cover
- special case
- max min
- worst case
- minimum cost
- facility location problem
- approximation ratio
- network design problem
- set cover
- disjoint paths
- exact algorithms
- approximation schemes
- primal dual
- open shop
- constant factor
- randomized algorithms
- polynomial time approximation
- computational complexity
- np hardness
- combinatorial auctions
- np complete