The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms.
Harold N. GabowSeth PettiePublished in: SWAT (2002)
Keyphrases
- approximation algorithms
- minimum cost
- constant factor
- undirected graph
- np hard
- special case
- worst case
- vertex cover
- facility location problem
- clustering algorithm
- approximation ratio
- approximation schemes
- set cover
- open shop
- network design problem
- k means
- randomized algorithms
- network flow
- primal dual
- constant factor approximation
- spanning tree
- combinatorial auctions
- linear programming
- dynamic programming
- computational complexity