@inproceedings{6666cc094ff54fe1942b8283b7c012a6,
title = "Approximation algorithms for the unsplittable flow problem on paths and trees",
abstract = "We study the UNSPLITTABLE FLOW PROBLEM (UFP) and related variants, namely UFP WITH BAG CONSTRAINTS and UFP WITH ROUNDS, on paths and trees. We provide improved constant factor approximation algorithms for all these problems under the no bottleneck assumption (NBA), which says that the maximum demand for any source-sink pair is at most the minimum capacity of any edge. We obtain these improved results by expressing a feasible solution to a natural LP relaxation of the UFP as a near-convex combination of feasible integral solutions.",
keywords = "Approximation algorithms, Integer decomposition, Linear programming, Scheduling, Unsplittable flows",
author = "Khaled Elbassioni and Naveen Garg and Divya Gupta and Amit Kumar and Vishal Narula and Arindam Pal",
year = "2012",
doi = "10.4230/LIPIcs.FSTTCS.2012.267",
language = "British English",
isbn = "9783939897477",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
pages = "267--275",
booktitle = "32nd International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012",
note = "32nd International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012 ; Conference date: 15-12-2012 Through 17-12-2012",
}