Improved approximation algorithms for unsplittable flow problems (Extended Abstract) (1997)
Cached
Download Links
- [www.cs.dartmouth.edu]
- [www.cs.dartmouth.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 38th Annual Symposium on Foundations of Computer Science |
| Citations: | 33 - 2 self |
BibTeX
@INPROCEEDINGS{Kolliopoulos97improvedapproximation,
author = {Stavros G. Kolliopoulos and Clifford Stein},
title = {Improved approximation algorithms for unsplittable flow problems (Extended Abstract)},
booktitle = {In Proceedings of the 38th Annual Symposium on Foundations of Computer Science},
year = {1997},
pages = {426--435}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
) Stavros G. Kolliopoulos 1 Clifford Stein 1 Abstract In the single-source unsplittable flow problem we are given a graph G; a source vertex s and a set of sinks t 1 ; : : : ; t k with associated demands. We seek a single s-t i flow path for each commodity i so that the demands are satisfied and the total flow routed across any edge e is bounded by its capacity c e : The problem is an NP-hard variant of max flow and a generalization of single-source edge-disjoint paths with applications to scheduling, load balancing and virtual-circuit routing problems. In a significant development, Kleinberg gave recently constant-factor approximation algorithms for several natural optimization versions of the problem [18]. In this paper we give a generic framework that yields simpler algorithms and significant improvements upon the constant factors. Our framework, with appropriate subroutines, applies to all optimization versions previously considered and treats in a unified manner directed and u...
