Approximation Algorithms for the Bipartite Multi-cut Problem
Sreyash KenkreSundar VishwanathanPublished in: CoRR (2006)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- facility location problem
- open shop
- network design problem
- vertex set
- integrality gap
- randomized algorithms
- set cover
- np hardness
- constant factor
- bipartite graph
- precedence constraints
- disjoint paths
- approximation ratio
- primal dual
- approximation schemes
- graph model
- polynomial time approximation
- lower bound