Approximation Algorithms for Generalized Bounded Tree Cover.
Barun GorainPartha Sarathi MandalKrishnendu MukhopadhyayaPublished in: WALCOM (2016)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- minimum cost
- facility location problem
- vertex cover
- tree structure
- spanning tree
- network design problem
- primal dual
- approximation schemes
- approximation ratio
- set cover
- undirected graph
- constant factor
- randomized algorithms
- open shop
- bounded degree
- precedence constraints
- combinatorial auctions
- upper bound
- approximation guarantees
- polynomial time approximation
- search algorithm
- computational complexity