Approximation algorithms for partially covering with edges.
Ojas ParekhPublished in: Theor. Comput. Sci. (2008)
Keyphrases
- approximation algorithms
- undirected graph
- special case
- np hard
- vertex cover
- minimum cost
- network design problem
- worst case
- facility location problem
- spanning tree
- precedence constraints
- exact algorithms
- directed graph
- primal dual
- open shop
- constant factor
- set cover
- approximation ratio
- disjoint paths
- approximation schemes
- constant factor approximation
- network flow
- combinatorial auctions
- weighted graph
- optimal solution