Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls.
Aaron ArcherAnna BlasiakPublished in: SODA (2010)
Keyphrases
- approximation algorithms
- prize collecting
- minimum cost
- constant factor
- np hard
- special case
- vertex cover
- facility location problem
- worst case
- randomized algorithms
- approximation ratio
- primal dual
- set cover
- open shop
- undirected graph
- combinatorial auctions
- image sequences
- spanning tree
- search algorithm
- network flow
- approximation guarantees
- particle swarm optimization