skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Single-source unsplittable flow

Abstract

The max-flow min-cut theorem of Ford and Fulkerson is based on an even more foundational result, namely Menger`s theorem on graph connectivity. Menger`s theorem provides a good characterization for the following single-source disjoint paths problem: given a graph G, with a source vertex s and terminals t{sub 1},..., t{sub k}, decide whether there exist edge-disjoint s-t{sub i} paths, for i = 1, . . . , k. We consider a natural, NP-hard generalization of this problem, which we call the single-source unsplittable flow problem. We are given a source and terminals as before; but now each terminal t{sub i} has a demand {rho}{sub i} {le} 1, and each edge e of G has a capacity c{sub e} {ge} 1. The problem is to decide whether one can choose a single s-t{sub i} path for each i, so that the resulting set of paths respects the capacity constraints - the total amount of demand routed across any edge e must be bounded by the capacity c{sub e}. The main results of this paper are constant-factor approximation algorithms for three natural optimization versions of this problem, in arbitrary directed and undirected graphs. The development of these algorithms requires a number of newmore » techniques for rounding fractional solutions to network flow problems; for two of the three problems we consider, there were no previous techniques capable of providing an approximation in the general case, and for the third, the randomized rounding algorithm of Raghavan and Thompson provides a logarithmic approximation. Our techniques are also of interest from the perspective of a family of NP-hard load balancing and machine scheduling problems that can be reduced to the single-source unsplittable flow problem.« less

Authors:
 [1]
  1. MIT, Cambridge, MA (United States)
Publication Date:
OSTI Identifier:
457638
Report Number(s):
CONF-961004-
TRN: 97:001036-0009
Resource Type:
Conference
Resource Relation:
Conference: 37. annual symposium on foundations of computer science, Burlington, VT (United States), 13-16 Oct 1996; Other Information: PBD: 1996; Related Information: Is Part Of Proceedings of the 37th annual symposium on foundations of computer science; PB: 656 p.
Country of Publication:
United States
Language:
English
Subject:
99 MATHEMATICS, COMPUTERS, INFORMATION SCIENCE, MANAGEMENT, LAW, MISCELLANEOUS; NETWORK ANALYSIS; OPTIMIZATION; DATA-FLOW PROCESSING; ALGORITHMS; COMPUTER NETWORKS; DIAGRAMS

Citation Formats

Kleinberg, J M. Single-source unsplittable flow. United States: N. p., 1996. Web.
Kleinberg, J M. Single-source unsplittable flow. United States.
Kleinberg, J M. 1996. "Single-source unsplittable flow". United States.
@article{osti_457638,
title = {Single-source unsplittable flow},
author = {Kleinberg, J M},
abstractNote = {The max-flow min-cut theorem of Ford and Fulkerson is based on an even more foundational result, namely Menger`s theorem on graph connectivity. Menger`s theorem provides a good characterization for the following single-source disjoint paths problem: given a graph G, with a source vertex s and terminals t{sub 1},..., t{sub k}, decide whether there exist edge-disjoint s-t{sub i} paths, for i = 1, . . . , k. We consider a natural, NP-hard generalization of this problem, which we call the single-source unsplittable flow problem. We are given a source and terminals as before; but now each terminal t{sub i} has a demand {rho}{sub i} {le} 1, and each edge e of G has a capacity c{sub e} {ge} 1. The problem is to decide whether one can choose a single s-t{sub i} path for each i, so that the resulting set of paths respects the capacity constraints - the total amount of demand routed across any edge e must be bounded by the capacity c{sub e}. The main results of this paper are constant-factor approximation algorithms for three natural optimization versions of this problem, in arbitrary directed and undirected graphs. The development of these algorithms requires a number of new techniques for rounding fractional solutions to network flow problems; for two of the three problems we consider, there were no previous techniques capable of providing an approximation in the general case, and for the third, the randomized rounding algorithm of Raghavan and Thompson provides a logarithmic approximation. Our techniques are also of interest from the perspective of a family of NP-hard load balancing and machine scheduling problems that can be reduced to the single-source unsplittable flow problem.},
doi = {},
url = {https://www.osti.gov/biblio/457638}, journal = {},
number = ,
volume = ,
place = {United States},
year = {Tue Dec 31 00:00:00 EST 1996},
month = {Tue Dec 31 00:00:00 EST 1996}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share: