Combinatorial Approximation Algorithms for Generalized Flow Problems
From MaRDI portal
Publication:2709797
DOI10.1006/jagm.2000.1130zbMath0969.68195MaRDI 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
68W25: Approximation algorithms
Related Items
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains, A simple GAP-canceling algorithm for the generalized maximum flow problem, 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, A generalized approximation framework for fractional network flow and packing problems, Monotonizing linear programs with up to two nonzeroes per column