Combinatorial optimization
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Mathematics of Operations Research
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
Universal Routing Strategies for Interconnection Networks
Universal Routing Strategies for Interconnection Networks
On the k-Splittable Flow Problem
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Approximation algorithms for disjoint paths problems
Approximation algorithms for disjoint paths problems
Short length menger's theorem and reliable optical routing
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Short length Menger's theorem and reliable optical routing
Theoretical Computer Science
Complexity and approximability of k-splittable flows
Theoretical Computer Science
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Approximation and complexity of k–splittable flows
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Hi-index | 0.00 |
In this paper we consider the k edge-disjoint paths problem (k-EDP), a generalization of the well-known edge-disjoint paths problem. Given a graph G=(V,E) and a set of terminal pairs (or requests) T, the problem is to find a maximum subset of the pairs in T for which it is possible to select paths such that each pair is connected by k edge-disjoint paths and the paths for different pairs are mutually disjoint. To the best of our knowledge, no nontrivial result is known for this problem for k1. To measure the performance of our algorithms we will use the recently introduced flow number F of a graph. This parameter is known to satisfy F=O(\Delta \alpha^-1 \log n), where \Delta is the maximum degree and \alpha is the edge expansion of G. We show that a simple, greedy online algorithm achieves a competitive ratio of O(k^3 \cdot F) which naturally extends the best known bound of O(F) for k=1 to higher $k$. To get this bound, we introduce a new method of converting a system of k disjoint paths into a system of k length-bounded disjoint paths. Also, an almost matching deterministic online lower bound \Omega(k \cdot F) is given.In addition, we study the k disjoint flows problem (k-DFP), which is a generalization of the well-known unsplittable flow problem (UFP). The k-DFP is similar to the k-EDP with the difference that we now consider a graph with edge capacities and the requests can have arbitrary demands d_i. The aim is to find a subset of requests of maximum total demand for which it is possible to select flow paths such that all the capacity constraints are maintained and each selected request with demand d_i is connected by k disjoint paths, each of flow value d_i/k.The k-EDP and k-DFP problems have important applications in fault-tolerant (virtual) circuit switching which plays a key role in optical networks.