Single-source unsplittable flow
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximation algorithms for disjoint paths problems
Approximation algorithms for disjoint paths problems
Algorithms for fault-tolerant routing in circuit switched networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Minimum-cost single-source 2-splittable flow
Information Processing Letters
High-bandwidth routing in dynamic peer-to-peer streaming
Proceedings of the ACM workshop on Advances in peer-to-peer multimedia streaming
Distributed network utility maximization in wireless networks with a bounded number of paths
Proceedings of the 3nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Minimum-cost single-source 2-splittable flow
Information Processing Letters
The hardness of selective network design for bottleneck routing games
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Parameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
SIAM Journal on Discrete Mathematics
Maximizing throughput in queueing networks with limited flexibility
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
A Branch and Price algorithm for the k-splittable maximum flow problem
Discrete Optimization
Towards an optimized abstracted topology design in cloud environment
Future Generation Computer Systems
| Hi-index | 0.00 |
In traditional multi-commodity flow theory, the task is to send a certain amount of each commodity from its start to its target node, subject to capacity constraints on the edges. However, no restriction is imposed on the number of paths used for delivering each commodity; it is thus feasible to spread the flow over a large number of different paths. Motivated by routing problems arising in real-life applications, such as, e. g., telecommunication, unsplittable flows have moved into the focus of research. Here, the demand of each commodity may not be split but has to be sent along a single path.In this paper, a generalization of this problem is studied. In the considered flow model, a commodity can be split into a bounded number of chunks which can then be routed on different paths. In contrast to classical (splittable) flows and unsplittable flows, already the single-commodity case of this problem is NP-hard and even hard to approximate. We present approximation algorithms for the single- and multicommodity case and point out strong connections to unsplittable flows. Moreover, results on the hardness of approximation are presented. It particular, we show that some of our approximation results are in fact best possible, unless P=NP.