scientific article; zbMATH DE number 1757944

zbMath1010.90521MaRDI QIDQ4537731

Oded Regev, Yossi Azar

Publication date: 20 June 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2081/20810015

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Related Items

Call control with \(k\) rejections, A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem, Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs, An exact approach for the maximum concurrent \(k\)-splittable flow problem, Maximizing residual capacity in connection-oriented networks, A note on the greedy algorithm for the unsplittable flow problem, Flows on few paths: Algorithms and lower bounds, A logarithmic approximation for unsplittable flow on line graphs