Approximation Algorithms for Minimum Tree Partition.
Nili Guttmann-BeckRefael HassinPublished in: Discret. Appl. Math. (1998)
Keyphrases
- approximation algorithms
- minimum cost
- constant factor
- spanning tree
- np hard
- special case
- worst case
- vertex cover
- facility location problem
- set cover
- randomized algorithms
- precedence constraints
- tree structure
- primal dual
- open shop
- combinatorial auctions
- approximation schemes
- np hardness
- approximation ratio
- undirected graph
- disjoint paths