Approximation algorithms for the Bipartite Multicut problem.
Sreyash KenkreSundar VishwanathanPublished in: Inf. Process. Lett. (2010)
Keyphrases
- approximation algorithms
- undirected graph
- special case
- np hard
- bipartite graph
- minimum cost
- facility location problem
- vertex cover
- worst case
- approximation ratio
- network design problem
- graph model
- np hardness
- open shop
- approximation schemes
- randomized algorithms
- primal dual
- constant factor
- exact algorithms
- constant factor approximation
- set cover
- graphical models
- closest string
- disjoint paths