A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths

In this paper, we present a constant-factor approximation algorithm for the unsplittable flow problem on a path. This improves on the previous best known approximation factor of O(log n). The approximation ratio of our algorithm is 7+e for any e>;0. In the unsplittable flow problem on a path, we...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	2011 IEEE 52nd Annual Symposium on Foundations of Computer Science s. 47 - 56
Hlavní autori:	Bonsma, P., Schulz, J., Wiese, A.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.10.2011
Predmet:	Algorithm design and analysis Approximation algorithms Approximation methods constant factor approximation Heuristic algorithms maximum weight independent set Partitioning algorithms Polynomials resource allocation Resource management strong NP-hardness unsplittable flow
ISBN:	145771843X, 9781457718434
ISSN:	0272-5428
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!