An Optimal Local Approximation Algorithm for Max-Min Linear Programs

被引:0
|
作者
Floreen, Patrik [1 ]
Kaasinen, Joel [1 ]
Kaski, Petteri [1 ]
Suomela, Jukka [1 ]
机构
[1] Univ Helsinki, HIIT, FI-00014 Helsinki, Finland
关键词
PLANAR GRAPHS;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In a max-min LP, the objective is to maximise omega subject to Ax <= 1, Cx >= omega 1, and x >= 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorithm) for approximating max-min Us. The approximation ratio Of Our algorithm is the best possible for any local algorithm; there is a matching unconditional lower bound.
引用
收藏
页码:260 / 269
页数:10
相关论文
共 50 条