Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees

Elbassioni, Khaled; Garg, Naveen; Gupta, Divya; Kumar, Amit; Narula, Vishal; Pal, Arindam

doi:10.4230/LIPIcs.FSTTCS.2012.267

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees

MPS-Authors

/persons/resource/persons44374

Elbassioni, Khaled
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2012/3865/
(Any fulltext)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Elbassioni, K., Garg, N., Gupta, D., Kumar, A., Narula, V., & Pal, A. (2012). Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees. In D. D'Souza, T. Kavitha, & J. Radhakrishnan (Eds.), 32nd International Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2012 (pp. 267-275). Dagstuhl: Schloß Dagstuhl/Leibniz Zentrum für Informatik. doi:10.4230/LIPIcs.FSTTCS.2012.267.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-F719-F

Abstract

There is no abstract available