Combinatorial Algorithms for the Unsplittable Flow Problem - Azar, Yossi; Regev, Oded (Algorithmica, 2006)
Keywords: 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