Constant-Time Local Computation Algorithms

Local computation algorithms (LCAs) produce small parts of a single (possibly approximate) solution to a given search problem using time and space sublinear in the size of the input. In this work we present LCAs whose time complexity (and usually also space complexity) is independent of the input size. Specifically, we give (1) a (1 − 𝜖)-approximation LCA to the maximum weight acyclic edge set, (2) LCAs for approximating multicut and integer multicommodity flow on trees, and (3) a local reduction of weighted matching to any unweighted matching LCA, such that the running time of the weighted matching LCA is d times (where d is the maximal degree) the running time of the unweighted matching LCA, (and therefore independent of the edge weight function).

[1]  Dana Ron,et al.  Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs , 2014, ESA.

[2]  Yishay Mansour,et al.  A Local Computation Approximation Scheme to Maximum Matching , 2013, APPROX-RANDOM.

[3]  Boaz Patt-Shamir,et al.  Distributed Approximate Matching , 2009, SIAM J. Comput..

[4]  Roger Wattenhofer,et al.  The price of being near-sighted , 2006, SODA '06.

[5]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[6]  Alessandro Panconesi,et al.  Some simple distributed algorithms for sparse networks , 2001, Distributed Computing.

[7]  Yishay Mansour,et al.  Converting Online Algorithms to Local Computation Algorithms , 2012, ICALP.

[8]  Richard Cole,et al.  Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..

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

[10]  James G. Oxley,et al.  Matroid theory , 1992 .

[11]  Jukka Suomela,et al.  Survey of local algorithms , 2013, CSUR.

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

[13]  Noga Alon,et al.  Space-efficient local computation algorithms , 2011, SODA.

[14]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[15]  Fabian Kuhn,et al.  Local Approximation of Covering and Packing Problems , 2008, Encyclopedia of Algorithms.

[16]  Roger Wattenhofer,et al.  Distributed Weighted Matching , 2004, DISC.

[17]  Ronitt Rubinfeld,et al.  Fast Local Computation Algorithms , 2011, ICS.

[18]  Mihalis Yannakakis,et al.  Primal-dual approximation algorithms for integral flow and multicut in trees , 1997, Algorithmica.

[19]  Moti Medina,et al.  Non-local Probes Do Not Help with Many Graph Problems , 2016, DISC.

[20]  Jukka Suomela,et al.  Lower bounds for local approximation , 2012, PODC '12.

[21]  Jaroslav Nesetril,et al.  Otakar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history , 2001, Discret. Math..

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

[23]  Krzysztof Onak,et al.  Constant-Time Approximation Algorithms via Local Improvements , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[24]  Zhi-Zhong Chen,et al.  Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs , 2000, IFIP TCS.

[25]  Zhi-Zhong Chen,et al.  Parallel approximation algorithms for maximum weighted matching in general graphs , 2000, Inf. Process. Lett..

[26]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[27]  Omer Reingold,et al.  New techniques and tighter bounds for local computation algorithms , 2014, J. Comput. Syst. Sci..

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