Approximation algorithms for $k$ -partitioning problems with partition matroid constraint.
Weidong LiJianping LiPublished in: Optim. Lett. (2014)
Keyphrases
- approximation algorithms
- vertex cover
- special case
- np hardness
- approximation schemes
- randomized algorithms
- np hard
- exact algorithms
- facility location problem
- worst case
- combinatorial optimization
- greedy algorithm
- constant factor
- primal dual
- disjoint paths
- greedy algorithms
- network design problem
- learning algorithm
- np complete
- optimization problems
- search algorithm
- objective function