The price of being near-sighted

Achieving a global goal based on local information is challenging, especially in complex and large-scale networks such as the Internet or even the human brain. In this paper, we provide 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. Specifically, we give a distributed algorithm using only small messages which obtains an (ρΔ)1/k-approximation for general covering and packing problems in time O(k2), where ρ depends on the LP's coefficients. If message size is unbounded, we present a second algorithm that achieves an O(n1/k) approximation in O(k) rounds. Finally, we prove that these algorithms are close to optimal by giving a lower bound on the approximability of packing problems given that each node has to base its decision on information from its k-neighborhood.

[1]  Tim Roughgarden,et al.  The price of anarchy is independent of the network topology , 2002, STOC '02.

[2]  Moni Naor,et al.  What Can be Computed Locally? , 1995, SIAM J. Comput..

[3]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[4]  Éva Tardos,et al.  Fast Approximation Algorithms for Fractional Packing and Covering Problems , 1995, Math. Oper. Res..

[5]  Michael Elkin,et al.  Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem , 2004, STOC '04.

[6]  Danny Raz,et al.  Global optimization using local information with applications to flow control , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[7]  N Linial,et al.  Low diameter graph decompositions , 1993, Comb..

[8]  Noam Nisan,et al.  A parallel approximation algorithm for positive linear programming , 1993, STOC.

[9]  Vijay V. Vazirani,et al.  Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs , 1999, SIAM J. Comput..

[10]  Neal E. Young,et al.  Sequential and parallel algorithms for mixed packing and covering , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[11]  Aravind Srinivasan,et al.  Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons , 2003, J. Comput. Syst. Sci..

[12]  Roger Wattenhofer,et al.  Constant-time distributed dominating set approximation , 2003, PODC '03.

[13]  Felix Lazebnik,et al.  Explicit Construction of Graphs with an Arbitrary Large Girth and of Large Size , 1995, Discret. Appl. Math..

[14]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[15]  R. Rajaraman,et al.  An efficient distributed algorithm for constructing small dominating sets , 2002 .

[16]  Moni Naor,et al.  What can be computed locally? , 1993, STOC.

[17]  Lisa Fleischer,et al.  A fast approximation scheme for fractional covering problems with variable upper bounds , 2004, SODA '04.

[18]  Mihalis Yannakakis,et al.  Linear programming without the matrix , 1993, STOC.

[19]  Alon Itai,et al.  A Fast and Simple Randomized Parallel Algorithm for Maximal Matching , 1986, Inf. Process. Lett..

[20]  Lisa Fleischer,et al.  Approximating fractional multicommodity flow independent of the number of commodities , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[21]  Boaz Patt-Shamir,et al.  MST construction in O(log log n) communication rounds , 2003, SPAA '03.

[22]  David Peleg,et al.  Distributed Computing: A Locality-Sensitive Approach , 1987 .

[23]  Roger Wattenhofer,et al.  What cannot be computed locally! , 2004, PODC '04.

[24]  Aravind Srinivasan,et al.  Improved approximations of packing and covering problems , 1995, STOC '95.

[25]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[26]  Tim Roughgarden,et al.  How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[27]  Thomas Moscibroda,et al.  What Cannot Be Computed Locally , 2004 .

[28]  Faith Ellen,et al.  Hundreds of impossibility results for distributed computing , 2003, Distributed Computing.

[29]  Neal E. Young,et al.  Randomized rounding without solving the linear program , 1995, SODA '95.

[30]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..