Combinatorial Algorithms for the Unsplittable Flow Problem

Saved in:
Bibliographic Details
Published inAlgorithmica Vol. 44; no. 1; pp. 49 - 66
Main Authors Azar, Yossi, Regev, Oded
Format Journal Article
LanguageEnglish
Published New York, NY Springer 01.01.2006
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Theoretical computing
Lower bound
Minimum time
Randomization
Combinatorial algorithms
Combinatorial problem
Best approximation
Unsplittable flow problem
Graph theory
Polynomial method
Approximation algorithm
Terminal
Directed graph
Online AccessGet full text

Cover

More Information
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-005-1172-z