Sciweavers

28 search results - page 1 / 6
» Approximation Algorithms for Disjoint Paths and Related Rout...
Sort
View
MOR
2000
162views more  MOR 2000»
13 years 2 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
TAMC
2009
Springer
13 years 9 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
FOCS
2005
IEEE
13 years 8 months ago
An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...
Jon M. Kleinberg
APPROX
2010
Springer
138views Algorithms» more  APPROX 2010»
13 years 4 months ago
Maximum Flows on Disjoint Paths
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
Guyslain Naves, Nicolas Sonnerat, Adrian Vetta
ESA
2009
Springer
146views Algorithms» more  ESA 2009»
13 years 9 months ago
Kernel Bounds for Disjoint Cycles and Disjoint Paths
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...
Hans L. Bodlaender, Stéphan Thomassé...