Login / Signup
Breaking the Multicommodity Flow Barrier for sqrt(log(n))-Approximations to Sparsest Cut
Jonah Sherman
Published in:
CoRR (2009)
Keyphrases
</>
multicommodity flow
worst case
lower bound
multicommodity flow problems
routing problem
linear program
upper bound
neural network
np hard
origin destination
undirected graph
genetic algorithm
scheduling problem
shortest path
integrality gap