An optimal local approximation algorithm for max-min linear programs

Details An optimal local approximation algorithm for max-min linear programs An optimal local approximation algorithm for max-min linear programs

2008-09-09

arxiv.org/abs/0809.1489v1

Computer Science

Distributed, Parallel, and Cluster Computing

16 pages, 3 figures

Scientific paper

We present a local algorithm (constant-time distributed algorithm) for
approximating max-min LPs. The objective is to maximise $\omega$ subject to $Ax
\le 1$, $Cx \ge \omega 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.

Affiliated with

Also associated with

No associations

Rating

An optimal local approximation algorithm for max-min linear programs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An optimal local approximation algorithm for max-min linear programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An optimal local approximation algorithm for max-min linear programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-210377