Combinatorial Approximation Algorithms for Generalized Flow Problems
From MaRDI portal
Publication:2709797
DOI10.1006/jagm.2000.1130zbMath0969.68195OpenAlexW2136834963MaRDI QIDQ2709797
Publication date: 7 October 2001
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.2000.1130
Related Items (7)
Optimal radio resources and transmission formats assignment in OFDMA systems ⋮ Robust flows with losses and improvability in evacuation planning ⋮ Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains ⋮ Shortest path and maximum flow problems in networks with additive losses and gains ⋮ Monotonizing linear programs with up to two nonzeroes per column ⋮ A generalized approximation framework for fractional network flow and packing problems ⋮ A simple GAP-canceling algorithm for the generalized maximum flow problem
This page was built for publication: Combinatorial Approximation Algorithms for Generalized Flow Problems
