Login / Signup
Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems.
Daniel Golovin
Vineet Goyal
R. Ravi
Published in:
STACS (2006)
Keyphrases
</>
approximation algorithms
shortest path problem
np hard
special case
min cut
worst case
minimum cost
undirected graph
shortest path
primal dual
multiple objectives
combinatorial optimization problems
evolutionary algorithm
dynamic programming
random walk
graph partitioning