A quasi-PTAS for unsplittable flow on line graphs

@inproceedings{Bansal2006AQF,
  title={A quasi-PTAS for unsplittable flow on line graphs},
  author={Nikhil Bansal and Amit Chakrabarti and Amir Epstein and Baruch Schieber},
  booktitle={STOC},
  year={2006}
}
We study the Unsplittable Flow Problem (UFP) on line graphs and cycles, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-polynomial time approximation scheme for UFP on line graphs, thereby ruling out an APX-hardness result, unless NP ⊆ DTIME(2polylog(n)). Our result requires a quasi-polynomial bound on all edge capacities and demands in the input instance. We extend this result to undirected cycle graphs.Earlier results on this… CONTINUE READING
Highly Cited
This paper has 89 citations. REVIEW CITATIONS
54 Citations
9 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 54 extracted citations

90 Citations

01020'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 90 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…