Fast approximation algorithms for multicommodity flow problems
From MaRDI portal
Publication:1892218
DOI10.1006/jcss.1995.1020zbMath0826.68055OpenAlexW4242767541MaRDI QIDQ1892218
Fillia Makedon, Spyros Tragoudas, Clifford Stein, Leighton, Tom, Serge A. Plotkin, Éva Tardos
Publication date: 5 July 1995
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/8862
Related Items
Greedy distributed optimization of multi-commodity flows ⋮ Approximation algorithms for treewidth ⋮ Costly circuits, submodular schedules and approximate Carathéodory theorems ⋮ EFFICIENT APPROXIMATION ALGORITHMS FOR PAIRWISE DATA CLUSTERING AND APPLICATIONS ⋮ Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time ⋮ Optimization in telecommunication networks ⋮ Heterogeneous flow distribution at the peak load in the multiuser network ⋮ Drawings of graphs on surfaces with few crossings ⋮ On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms ⋮ A combinatorial approximation algorithm for supply chain network flow problem ⋮ Improved approximations for the minimum-cut ratio and the flux ⋮ Hardness Results for Structured Linear Systems ⋮ Analysis of the load distribution and internodal flows under different routing strategies in a multiuser network ⋮ Unnamed Item ⋮ A fast polynomial time algorithm for logistics network flows ⋮ Fast approximation of minimum multicast congestion – Implementation VERSUS Theory ⋮ Optimal Multicommodity Flow Through the Complete Graph with Random Edge Capacities ⋮ On the complexity of bandwidth allocation in radio networks ⋮ The forwarding index of communication networks with given connectivity ⋮ Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem ⋮ Uniform multicommodity flows in the hypercube with random edge‐capacities ⋮ A combinatorial approximation algorithm for concurrent flow problem and its application ⋮ Self-concordant barriers for convex approximations of structured convex sets ⋮ Multicast Routing and Design of Sparse Connectors ⋮ Flows with unit path capacities and related packing and covering problems
