An optimal local approximation algorithm for max-min linear programs

@inproceedings{Floren2008AnOL,
  title={An optimal local approximation algorithm for max-min linear programs},
  author={Patrik Flor{\'e}en and Joel Kaasinen and Petteri Kaski and Jukka Suomela},
  booktitle={ACM Symposium on Parallelism in Algorithms and Architectures},
  year={2008}
}
In a max-min LP, the objective is to maximise ω subject to <i>A</i><b>x</b> ≤ <b>1</b>, <i>C</i><b>x</b> ≥ ω<b>1</b>, and <b>x</b> ≥ 0 for nonnegative matrices <i>A</i> and <i>C</i>. We present a local algorithm (constant-time distributed algorithm) for approximating max-min LPs. The approximation ratio of our algorithm is the best possible for any local algorithm; there is a matching unconditional lower bound. 
View on ACM
helda.helsinki.fi
19 Citations
Background Citations
8
Methods Citations
1

Figures from this paper

19 Citations

Local Approximability of Max-Min and Min-Max Linear Programs

It is shown that for any ΔI≤2, ΔK≥2, and ε>0 there exists a local algorithm that achieves the approximation ratio ΔI(1−1/ΔK)+ε, and that this result is the best possible: no local algorithm can achieve the approximability of max-min LPs and min-max LPs.

Tight Local Approximation Results for Max-Min Linear Programs

The technique of graph unfolding for the design of local approximation algorithms is introduced and it is shown that for every e> 0 there exists a local algorithm achieving theroximation ratio Δ I (1 − 1/Δ K) + e.

Analysing local algorithms in location-aware quasi-unit-disk graphs

Randomized Local Network Computing

It is proved that the same derandomization result holds for every task whose solutions can be locally checked using a 2-sided error randomized Monte-Carlo algorithm, and that randomization does not help for solving such resilient tasks.

A Local 2-Approximation Algorithm for the Vertex Cover Problem

A distributed 2-approximation algorithm for the minimum vertex cover problem is presented, and it runs in (Δ + 1)2 synchronous communication rounds, where Δ is the maximum degree of the graph.

Randomized Local Network Computing: Derandomization Beyond Locally Checkable Labelings

It is proved that the same derandomization result holds for every task such that the correctness of their solutions can be locally checked using a 2-sided error randomized Monte-Carlo algorithm.

A Bibliography of Local Algorithms

This online bibliography is a supplement to the following survey article [108]: Jukka Suomela (2013). Survey of local algorithms. ACM Computing Surveys, volume 45, issue 2, article 24. This…

Survey of local algorithms

This work surveys the state-of-the-art in the field of local algorithm design, covering impossibility results, deterministic local algorithms, randomized localgorithms, and local algorithms for geometric graphs.

Optimisation problems in wireless sensor networks: Local algorithms and local graphs

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks, to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links.

What Can Be Verified Locally? ∗

It is shown that every Turing-decidable predicate on labeled networks can be decided locally if nodes are running alternating Turing machines (ATM), and there is a local algorithm for ATMs that decides whether the actual labeled network satisfies that predicate.

References

SHOWING 1-10 OF 20 REFERENCES

Approximating max-min linear programs with local algorithms

A local approximation algorithm is presented which achieves good approximation ratios if it can bound the relative growth of the vertex neighbourhoods in H.

Tight Local Approximation Results for Max-Min Linear Programs

The technique of graph unfolding for the design of local approximation algorithms is introduced and it is shown that for every e> 0 there exists a local algorithm achieving theroximation ratio Δ I (1 − 1/Δ K) + e.

Local approximation algorithms for a class of 0/1 max-min linear programs

A local approximation algorithm is presented which achieves an approximation ratio arbitrarily close to the theoretical lower bound presented in prior work.

Approximation algorithms for NP-complete problems on planar graphs

  • B. Baker
  • Mathematics, Computer Science
    24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
A general technique that can be used to obtain approximation algorithms for various NP-complete problems on planar graphs, which includes maximum independent set, maximum tile salvage, partition into triangles, maximum H-matching, minimum vertex cover, minimum dominating set, and minimum edge dominating set.

Sequential and parallel algorithms for mixed packing and covering

  • N. Young
  • Computer Science
    Proceedings 2001 IEEE International Conference on Cluster Computing
  • 2001
The main contribution is that the algorithms solve mixed packing and covering problems (in contrast to pure packing or pure covering problems, which have only "/spl les/" or only "/ spl ges/" inequalities) and run in time independent of the so-called width of the problem.

Linear programming without the matrix

This work studies the problem facing a set of decision-makers who must select values for the variables of a linear program, when only parts of the matrix are available to each of them, and shows different bounds for the optimum ratio, a complicated parameter of the associated hypergraph.

The price of being near-sighted

This paper provides an almost tight classification of the possible trade-off between the amount of local information and the quality of the global solution for general covering and packing problems and gives a distributed algorithm using only small messages which obtains an (ρΔ)1/k-approximation in time O(k2).

Approximation schemes for covering and packing problems in image processing and VLSI

The unified technique that is introduced here, referred to as the shifting strategy, is applicable to numerous geometric covering and packing problems and how it varies with problem parameters is illustrated.

Local computations on static and dynamic graphs

The happy coloring and orientation problem is introduced and it is shown that it yields a robust local solution to the (d,m)-dining philosophers problem of Naor and Stockmeyer and the amount of initial symmetry-breaking needed to solve certain problems locally is investigated.

Locality in Distributed Graph Algorithms

  • N. Linial
  • Mathematics, Computer Science
    SIAM J. Comput.
  • 1992
This model focuses on the issue of locality in distributed processing, namely, to what extent a global solution to a computational problem can be obtained from locally available data.