Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design.
R. RaviF. Sibel SalmanPublished in: ESA (1999)
Keyphrases
- approximation algorithms
- network design
- network design problem
- np hard
- vertex cover
- communication networks
- special case
- worst case
- minimum cost
- approximation ratio
- network architecture
- facility location
- set cover
- primal dual
- routing problem
- combinatorial auctions
- open shop
- vehicle routing problem
- randomized algorithms
- anomaly detection
- approximation guarantees
- linear programming