Lower bounds for on-line graph problems with application to on-line circuit and optical routing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Node-disjoint paths on the mesh and a new trade-off in VLSI layout
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
Adaptive packet routing for bursty adversarial traffic
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Decision algorithms for unsplittable flow and the half-disjoint paths problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Routing and admission control in general topology networks with Poisson arrivals
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The growth rate of vertex-transitive planar graphs
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling multicasts on unit-capacity trees and meshes
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Online througput-competitive algorithm for multicast routing and admission control
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On-line randomized call control revisited
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
New algorithmic aspects of the Local Lemma with applications to routing and partitioning
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
ACM Computing Surveys (CSUR)
Simple on-line algorithms for the maximum disjoint paths problem
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Improved bounds for the unsplittable flow problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic routing on networks with fixed-size buffers
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Routing a Permutation in the Hypercube by Two Sets of Edge-Disjoint Paths
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Call Control with k Rejections
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
On-line Algorithms for Edge-Disjoint Paths in Trees of Rings
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Online Call Admission in Optical Networks with Larger Demands
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Scheduling multicasts on unit-capacity trees and meshes
Journal of Computer and System Sciences
Journal of Experimental Algorithmics (JEA)
Journal of Computer and System Sciences
Call control with k rejections
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Journal of Scheduling - Special issue: On-line algorithm part I
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Hardness of the undirected edge-disjoint paths problem
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Distributed online call control on general networks
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An online throughput-competitive algorithm for multicast routing and admission control
Journal of Algorithms
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Optimal Path Embedding in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Edge-disjoint paths in Planar graphs with constant congestion
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Path problems in generalized stars, complete graphs, and brick wall graphs
Discrete Applied Mathematics - Special issue: Efficient algorithms
Logarithmic hardness of the undirected edge-disjoint paths problem
Journal of the ACM (JACM)
Short length Menger's theorem and reliable optical routing
Theoretical Computer Science
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs
Journal of Discrete Algorithms
A nearly linear time algorithm for the half integral disjoint paths packing
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Journal of Experimental Algorithmics (JEA)
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Disjoint paths in sparse graphs
Discrete Applied Mathematics
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Path problems in generalized stars, complete graphs, and brick wall graphs
Discrete Applied Mathematics - Special issue: Efficient algorithms
The edge disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Edge Disjoint Paths in Moderately Connected Graphs
SIAM Journal on Computing
The disjoint paths problem: algorithm and structure
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Online packet-routing in grids with bounded buffers
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two
Proceedings of the forty-third annual ACM symposium on Theory of computing
Deterministic online optical call admission revisited
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Routing and coloring for maximal number of trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Edge disjoint paths in moderately connected graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The disjoint paths problem in quadratic time
Journal of Combinatorial Theory Series B
Approximation algorithms for path coloring in trees
Efficient Approximation and Online Algorithms
Approximation algorithms for edge-disjoint paths and unsplittable flow
Efficient Approximation and Online Algorithms
An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.01 |
We consider the following maximum disjoint paths problem (MDPP). We are given a large network, and pairs of nodes that wish to communicate over paths through the network-the goal is to simultaneously connect as many of these pairs as possible in such a way that no two communication paths share an edge in the network. This classical problem has been brought into focus recently in papers discussing applications to routing in high-speed networks, where the current lack of understanding of the MDPP is an obstacle to the design of practical heuristics. We consider the class of densely embedded, nearly-Eulerian graphs, which includes the two-dimensional mesh and other planar and locally planar interconnection networks. We obtain a constant-factor approximation algorithm for the maximum disjoint paths problem for this class of graphs; this improves on an O(log n)-approximation for the special case of the two-dimensional mesh due to Aumann-Rabani and the authors. For networks that are not explicitly required to be "high-capacity," this is the first constant-factor approximation for the MDPP in any class of graphs other than trees. We also consider the MDPP in the on-line setting, relevant to applications in which connection requests arrive over time and must be processed immediately. Here we obtain an asymptptically optimal O(log n)competitive on-line algorithm for the same class of graphs; this improves on an O(log n log log n) competitive algorithm for the special case of the mesh due to B. Awerbuch et al (1994).