An Experimental Study about Efficiency of the Approximation Algorithms for Minimum Latency Problem.
Ha Bang BanNguyen Duc NghiaPublished in: RIVF (2012)
Keyphrases
- approximation algorithms
- minimum cost
- constant factor
- np hard
- worst case
- vertex cover
- special case
- open shop
- np hardness
- facility location problem
- approximation schemes
- undirected graph
- primal dual
- precedence constraints
- network design problem
- set cover
- approximation ratio
- exact algorithms
- computational complexity
- randomized algorithms
- network flow
- search algorithm
- disjoint paths