Improved Approximation Algorithms for the Spanning Star Forest Problem.
Ning ChenRoee EngelbergC. Thach NguyenPrasad RaghavendraAtri RudraGyanit SinghPublished in: Algorithmica (2013)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- facility location problem
- worst case
- minimum cost
- exact algorithms
- set cover
- open shop
- approximation ratio
- primal dual
- constant factor
- approximation schemes
- network design problem
- undirected graph
- constant factor approximation
- precedence constraints
- np hardness
- search algorithm
- combinatorial auctions
- lower bound