




















We present a local algorithm (constant-time distributed algorithm) for approximating max-min LPs. The objective is to maximise $ω$ subject to $Ax \le 1$, $Cx \ge ω1$, and $x \ge 0$ for nonnegative matrices $A$ and $C$. The approximation ratio of our algorithm is the best possible for any local algorithm; there is a matching unconditional lower bound.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。