Sciweavers

Share
42 search results - page 1 / 9
» On Linear Programming Relaxations for Unsplittable Flow in T...
Sort
View
MOR
2000
162views more  MOR 2000»
11 years 1 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
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 f...
Alok Baveja, Aravind Srinivasan
APPROX
2009
Springer
139views Algorithms» more  APPROX 2009»
11 years 8 months ago
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
Chandra Chekuri, Alina Ene, Nitish Korula
CORR
2008
Springer
141views Education» more  CORR 2008»
11 years 1 months ago
Truthful Unsplittable Flow for Large Capacity Networks
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 ...
Yossi Azar, Iftah Gamzu, Shai Gutner
ICALP
2003
Springer
11 years 6 months ago
Multicommodity Demand Flow in a Tree
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepher...
CORR
2006
Springer
127views Education» more  CORR 2006»
11 years 1 months ago
A Semidefinite Relaxation for Air Traffic Flow Scheduling
We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation tech...
Alexandre d'Aspremont, Laurent El Ghaoui
books