Results 1  10
of
32,158
On the SingleSource Unsplittable Flow Problem
, 1998
"... Let G = (V; E) be a capacitated directed graph with a source s and k terminals t i with demands d i , 1 i k. We would like to concurrently route every demand on a single path from s to the corresponding terminal without violating the capacities. There are several interesting and important varia ..."
Abstract

Cited by 48 (2 self)
 Add to MetaCart
variations of this unsplittable flow problem. If the
Approximation Algorithms for the Unsplittable Flow Problem
"... We present approximation algorithms for the unsplittable flow problem (UFP) on undirected graphs. As is standard in this line of research, we assume that the maximum demand is at most the minimum capacity. We focus on the nonuniform capacity case in which the edge capacities can vary arbitrarily ..."
Abstract

Cited by 55 (9 self)
 Add to MetaCart
We present approximation algorithms for the unsplittable flow problem (UFP) on undirected graphs. As is standard in this line of research, we assume that the maximum demand is at most the minimum capacity. We focus on the nonuniform capacity case in which the edge capacities can vary arbitrarily
Approximation Algorithms for the Unsplittable Flow Problem ∗
, 2005
"... We present approximation algorithms for the unsplittable flow problem (UFP) in undirected graphs. As is standard in this line of research, we assume that the maximum demand is at most the minimum capacity. We focus on the nonuniform capacity case in which the edge capacities can vary arbitrarily ov ..."
Abstract
 Add to MetaCart
We present approximation algorithms for the unsplittable flow problem (UFP) in undirected graphs. As is standard in this line of research, we assume that the maximum demand is at most the minimum capacity. We focus on the nonuniform capacity case in which the edge capacities can vary arbitrarily
Combinatorial algorithms for the unsplittable flow problem
 Algorithmica
"... We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed) capacitated graph with n vertices and m edges, and a set of terminal pairs each with its own demand and profit. The obje ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed) capacitated graph with n vertices and m edges, and a set of terminal pairs each with its own demand and profit
Improved Bounds for the Unsplittable Flow Problem
 In Proceedings of the 13th ACMSIAM Symposium on Discrete Algorithms
, 2002
"... In this paper we consider the unsplittable ow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) with associated demands, find a subset of the pairs of maximum total demand for which a single flow path can be chosen for eac ..."
Abstract

Cited by 56 (6 self)
 Add to MetaCart
In this paper we consider the unsplittable ow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) with associated demands, find a subset of the pairs of maximum total demand for which a single flow path can be chosen
A Note on the Greedy Algorithm for the Unsplittable Flow Problem
 Information Processing Letters
, 2002
"... In a recent paper Chekuri and Khanna improved the analysis of the Greedy algorithm for the Edge Disjoint Paths problem and proved the same bounds also for the related Uniform Capacity Unsplittable Flow Problem. Here we show that their ideas can be used to get the same approximation ratio even fo ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
In a recent paper Chekuri and Khanna improved the analysis of the Greedy algorithm for the Edge Disjoint Paths problem and proved the same bounds also for the related Uniform Capacity Unsplittable Flow Problem. Here we show that their ideas can be used to get the same approximation ratio even
Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees
"... 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 ..."
Abstract
 Add to MetaCart
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
Strongly Polynomial Algorithms for the Unsplittable Flow Problem
 In Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization (IPCO
, 2001
"... We provide the first strongly polynomial algorithms with the best approximation ratio for all three variants of the unsplittable ow problem (UFP). In this problem we are given a (possibly directed) capacitated graph with n vertices and m edges, and a set of terminal pairs each with its own demand an ..."
Abstract

Cited by 48 (1 self)
 Add to MetaCart
We provide the first strongly polynomial algorithms with the best approximation ratio for all three variants of the unsplittable ow problem (UFP). In this problem we are given a (possibly directed) capacitated graph with n vertices and m edges, and a set of terminal pairs each with its own demand
Improved approximation algorithms for unsplittable flow problems (Extended Abstract)
 IN PROCEEDINGS OF THE 38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1997
"... In the singlesource 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 st 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 it ..."
Abstract

Cited by 44 (2 self)
 Add to MetaCart
In the singlesource 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 st i flow path for each commodity i so that the demands are satisfied and the total flow routed across any edge e is bounded
A Nearlinear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints
"... Consider a scenario where we need to schedule a set of jobs on a system offering some resource (such as electrical power or communication bandwidth), which we shall refer to as bandwidth. Each job consists of a set (or bag) of job instances. For each job instance, the input specifies the start time, ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
requirement of any job instance is at most the minimum bandwidth available. We present a simple, nearlinear time constant factor approximation algorithm for this problem, under NBA. When each job consists of only one job instance, the above problem is the same as the wellstudied unsplittable flow problem
Results 1  10
of
32,158