Approximation Algorithms for Minimum Chain Vertex Deletion.
Mrinal KumarSounaka MishraN. Safina DeviSaket SaurabhPublished in: WALCOM (2011)
Keyphrases
- approximation algorithms
- minimum cost
- constant factor
- undirected graph
- np hard
- worst case
- special case
- vertex cover
- network design problem
- open shop
- facility location problem
- primal dual
- set cover
- network flow
- exact algorithms
- np hardness
- approximation ratio
- approximation schemes
- polynomial time approximation
- spanning tree
- randomized algorithms
- minimum weight
- precedence constraints
- combinatorial auctions
- minimum length
- objective function
- directed graph
- linear programming
- upper bound
- constant factor approximation