Approximation algorithms for geometric shortest path problems.
Lyudmil AleksandrovAnil MaheshwariJörg-Rüdiger SackPublished in: STOC (2000)
Keyphrases
- approximation algorithms
- shortest path problem
- shortest path
- special case
- np hard
- vertex cover
- combinatorial optimization problems
- worst case
- directed graph
- network design problem
- multiple objectives
- minimum cost
- facility location problem
- approximation schemes
- np hardness
- directed acyclic graph
- approximation ratio
- set cover
- undirected graph
- randomized algorithms
- primal dual
- disjoint paths
- error bounds
- metaheuristic
- precedence constraints
- random walk
- constant factor
- approximation guarantees
- multi objective
- search algorithm
- bayesian networks
- neural network