Results 11  20
of
875
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
Truthful unsplittable flow for large capacity networks
 In Proceedings 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures
, 2007
"... The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and a set of connection requests, each of which is associated with source and target vertices, a demand, and a value. The obj ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and a set of connection requests, each of which is associated with source and target vertices, a demand, and a value
Approximation algorithms for singlesource unsplittable flow
 SIAM Journal on Computing
, 2002
"... In the singlesource unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain sinks in a given graph with edge capacities. The demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacit ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
In the singlesource unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain sinks in a given graph with edge capacities. The demand of each commodity must be routed along a single path so that the total flow through any edge is at most its
Approximation algorithms for edgedisjoint paths and unsplittable flow
 Efficient Approximation and Online Algorithms
, 2006
"... Abstract. In the maximum edgedisjoint paths problem (MEDP) the input consists of a graph and a set of requests (pairs of vertices), and the goal is to connect as many requests as possible along edgedisjoint paths. We give a survey of known results about the complexity and approximability of MEDP ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
and sketch some of the main ideas that have been used to obtain approximation algorithms for the problem. We consider also the generalization of MEDP where the edges of the graph have capacities and each request has a profit and a demand, called the unsplittable flow problem.
Rollout algorithms for topology control and routing of unsplittable flows
 in wireless optical backbone networks,” Conference on Information Sciences and Systems
, 2005
"... Abstract — We consider the problem of topology control and routing of unsplittable flows in wireless optical networks with pointtopoint links. Such networks could form a backbone for either a cellular network or hierarchical ad hoc network. Each backbone node has a limited number of transceivers w ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Abstract — We consider the problem of topology control and routing of unsplittable flows in wireless optical networks with pointtopoint links. Such networks could form a backbone for either a cellular network or hierarchical ad hoc network. Each backbone node has a limited number of transceivers
A QuasiPTAS for Unsplittable Flow on Line Graphs
"... ABSTRACT We study the Unsplittable Flow Problem (UFP) on line graphs andcycles, focusing on the longstanding open question of whether the problem is APXhard. We describe a deterministic quasipolynomialtime approximation scheme for UFP on line graphs, thereby ruling out an APXhardness result, unl ..."
Abstract
 Add to MetaCart
ABSTRACT We study the Unsplittable Flow Problem (UFP) on line graphs andcycles, focusing on the longstanding open question of whether the problem is APXhard. We describe a deterministic quasipolynomialtime approximation scheme for UFP on line graphs, thereby ruling out an APXhardness result
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
The hardness of network design for unsplittable flow with selfish users
 In Approximation and Online Algorithms, Third International Workshop (WAOA
, 2005
"... Abstract. In this paper we consider the network design for selfish users problem, where we assume the more realistic unsplittable model in which the users can have general demands and each user must choose a single path between its source and its destination. This model is also called atomic (weight ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. In this paper we consider the network design for selfish users problem, where we assume the more realistic unsplittable model in which the users can have general demands and each user must choose a single path between its source and its destination. This model is also called atomic
Results 11  20
of
875