Approximation algorithms for shortest descending paths in terrains.
Mustaq AhmedSandip DasSachin LodhaAnna LubiwAnil MaheshwariSasanka RoyPublished in: J. Discrete Algorithms (2010)
Keyphrases
- approximation algorithms
- shortest path
- disjoint paths
- path length
- np hard
- special case
- minimum cost
- vertex cover
- worst case
- set cover
- primal dual
- open shop
- approximation schemes
- facility location problem
- network design problem
- approximation ratio
- exact algorithms
- np hardness
- constant factor
- randomized algorithms
- undirected graph
- constant factor approximation
- search space
- approximation guarantees
- precedence constraints
- resource allocation