Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem.
Hiroshi NagamochiKohei OkadaPublished in: ISAAC (2003)
Keyphrases
- approximation algorithms
- special case
- np hard
- approximation ratio
- worst case
- vertex cover
- minimum cost
- np hardness
- constant factor
- facility location problem
- network design problem
- randomized algorithms
- set cover
- primal dual
- min sum
- precedence constraints
- approximation guarantees
- polynomial time approximation
- search algorithm
- approximation schemes
- combinatorial auctions
- partial order
- linear program
- np complete
- open shop