Publication:4537731
From MaRDI portal
zbMath1010.90521MaRDI QIDQ4537731
Publication date: 20 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2081/20810015
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
90C27: Combinatorial optimization
Related Items
Flows on few paths: Algorithms and lower bounds, A logarithmic approximation for unsplittable flow on line graphs, Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs, A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem, 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, Call control with \(k\) rejections