@article {17560,
	title = {Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems},
	journal = {Mathematics of Operations ResearchMathematics of Operations Research},
	volume = {25},
	year = {2000},
	month = {2000/05/01/},
	pages = {255 - 280},
	abstract = {Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths for these requests. We present improved approximation algorithms and/or integrality gaps for all problems considered; the central theme of this work is the underlying multicommodity flow relaxation. Applications of these techniques to approximating families of packing integer programs are also presented.},
	keywords = {Approximation algorithms, Disjoint paths, integer programming, Linear programming, multicommodity flow, Packing, randomized algorithms, rounding, Routing, unsplittable flow},
	isbn = {0364-765X, 1526-5471},
	doi = {10.1287/moor.25.2.255.12228},
	url = {http://mor.journal.informs.org/content/25/2/255},
	author = {Baveja,Alok and Srinivasan, Aravind}
}
