direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Logo der TU Berlin

Inhalt des Dokuments

Preprint 06-2011

Combinatorial Optimization & Graph Algorithms group (COGA-Preprints)

Title
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
Authors
Classification
not available
Keywords
Unsplittable Flow, Approximation Algorithm, Scheduling, Rectangle Intersection
Abstract
We study the unsplittable flow problem on a path P. We are given a set of n tasks. Each task is specified by a sub path of P, a demand, and a profit. Moreover, each edge of P has a given capacity. The aim is to find a subset of the tasks with maximum profit, for which the given demands can be simultaneously routed along P, subject to the capacities. The best known polynomial time approximation algorithm for this problem achieves a performance ratio of O(log n) and the best known hardness result is weak NP-hardness. In this paper, we firstly show that the problem is strongly NP-hard, even when the capacities are constant, and all demands are chosen from {1,2,3}. Secondly, we present the first polynomial time constant-factor approximation algorithm for this problem, achieving an approximation factor of 7+epsilon for any epsilon>0. This answers an open question from Bansal et al. (SODA'09). We employ a novel framework which reduces the problem to instances where the capacities of the edges differ by at most a constant factor. Moreover, for the difficult "large" tasks - for which in particular the straightforward linear program has an integrality gap of Omega(n) - we present a new geometrically inspired dynamic program.
Our techniques yields several other results which are of independent interest: for any epsilon>0 and beta>0, we give an (3+epsilon)-approximation algorithm for the case that each task uses at most a (1-beta)-fraction of the capacities of its edges. Furthermore, we give a (2+epsilon)-approximation algorithm that violates the capacities by at most a factor 1+epsilon (resource augmentation). Finally, we show that already a running time of O(n^4 log n) suffices to obtain a constant factor approximation algorithm for the general case.
Source
Download as [PDF]
Title: Source

Zusatzinformationen / Extras

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe