92 citations · 310 across the 34 of their papers we have counts for
Showing 2008 · cs.DCShow all
3 papers · 2 filters
cs.DC2008★ 17 cited
An optimal local approximation algorithm for max-min linear programs
Patrik Floréen, Joel Kaasinen, Petteri Kaski +1
We present a local algorithm (constant-time distributed algorithm) for approximating max-min LPs. The objective is to maximise subject to , , and …
cs.DC2008★ 7 cited
Local approximation algorithms for a class of 0/1 max-min linear programs
Patrik Floréen, Marja Hassinen, Petteri Kaski +1
We study the applicability of distributed, local algorithms to 0/1 max-min LPs where the objective is to maximise subject to ${\sum_v a_{iv} x_v \le 1}…
cs.DC2008★ 8 cited
Tight local approximation results for max-min linear programs
Patrik Floréen, Marja Hassinen, Petteri Kaski +1
In a bipartite max-min LP, we are given a bipartite graph $\myG = (V \cup I \cup K, E)$, where each agent is adjacent to exactly one constraint and exactly one…