Improved bounds for the unsplittable flow problem

P. Kolman, C. Scheideler, J. Algorithms 61 (2006) 20.

Download
No fulltext has been uploaded.
Journal Article
Author
Publishing Year
Journal Title
J. Algorithms
Volume
61
Issue
1
Page
20--44
LibreCat-ID

Cite this

Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. J Algorithms. 2006;61(1):20-44. doi:10.1016/j.jalgor.2004.07.006.
Kolman, P., & Scheideler, C. (2006). Improved bounds for the unsplittable flow problem. J. Algorithms, 61(1), 20–44. http://doi.org/10.1016/j.jalgor.2004.07.006
@article{Kolman_Scheideler_2006, title={Improved bounds for the unsplittable flow problem}, volume={61}, DOI={10.1016/j.jalgor.2004.07.006}, number={1}, journal={J. Algorithms}, author={Kolman, Petr and Scheideler, Christian}, year={2006}, pages={20–44}}
Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” J. Algorithms 61, no. 1 (2006): 20–44. doi:10.1016/j.jalgor.2004.07.006.
P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” J. Algorithms, vol. 61, no. 1, pp. 20–44, 2006.
Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” J. Algorithms 61.1 (2006): 20–44. Web.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar