Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control

DOI10.1137/S0097539700379383zbMath1105.68112OpenAlexW2013470587MaRDI QIDQ4651514

Danny Raz, John W. Byers, Yair Bartal

Publication date: 21 February 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539700379383

zbMATH Keywords

linear programmingapproximation algorithmflow controlprimal-dual

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (3)

A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs ⋮ Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence ⋮ On randomized fictitious play for approximating saddle points over convex sets

This page was built for publication: Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control