Approximation algorithms for a heterogeneous Multiple Depot Hamiltonian Path Problem.
Sai YadlapalliJungyun BaeSivakumar RathinamSwaroop DarbhaPublished in: ACC (2011)
Keyphrases
- approximation algorithms
- hamiltonian path
- minimum cost
- np hard
- special case
- worst case
- vertex cover
- constant factor
- facility location problem
- open shop
- exact algorithms
- constant factor approximation
- randomized algorithms
- np hardness
- network design problem
- genetic algorithm
- primal dual
- approximation ratio
- complex networks
- mathematical model
- scheduling problem
- computational complexity