Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack.
Hassene AissiCristina BazganDaniel VanderpootenPublished in: ESA (2005)
Keyphrases
- shortest path
- min max
- spanning tree
- minimum spanning tree
- weighted graph
- edge weights
- worst case
- shortest path problem
- shortest path algorithm
- minimum weight
- minimum spanning trees
- minimum cost
- approximation algorithms
- road network
- routing algorithm
- path length
- knapsack problem
- steiner tree
- shortest distance
- dynamic programming
- undirected graph
- upper bound
- lower bound
- combinatorial optimization problems
- flow graph
- travel time
- feasible solution
- linear programming relaxation
- euclidean distance
- minimal surface
- sensor networks