Login / Signup
A logarithmic approximation for unsplittable flow on line graphs.
Nikhil Bansal
Zachary Friggstad
Rohit Khandekar
Mohammad R. Salavatipour
Published in:
SODA (2009)
Keyphrases
</>
graph matching
closed form
graph theory
flow field
social networks
approximation error
error bounds
approximation algorithms
worst case
graph model
graph representation
flow patterns
series parallel
approximation methods
graph construction
labeled graphs
max cut
relative error
queueing networks
knn
lower bound