{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article11985","name":"Local Computation Algorithms for Spanners","abstract":"A graph spanner is a fundamental graph structure that faithfully preserves the pairwise distances in the input graph up to a small multiplicative stretch. The common objective in the computation of spanners is to achieve the best-known existential size-stretch trade-off efficiently.\nClassical models and algorithmic analysis of graph spanners essentially assume that the algorithm can read the input graph, construct the desired spanner, and write the answer to the output tape. However, when considering massive graphs containing millions or even billions of nodes not only the input graph, but also the output spanner might be too large for a single processor to store.\nTo tackle this challenge, we initiate the study of local computation algorithms (LCAs) for graph spanners in general graphs, where the algorithm should locally decide whether a given edge (u,v) in E belongs to the output (sparse) spanner or not. Such LCAs give the user the \"illusion\" that a specific sparse spanner for the graph is maintained, without ever fully computing it. We present several results for this setting, including: \n- For general n-vertex graphs and for parameter r in {2,3}, there exists an LCA for (2r-1)-spanners with O~(n^{1+1\/r}) edges and sublinear probe complexity of O~(n^{1-1\/2r}). These size\/stretch trade-offs are best possible (up to polylogarithmic factors). \n- For every k >= 1 and n-vertex graph with maximum degree Delta, there exists an LCA for O(k^2) spanners with O~(n^{1+1\/k}) edges, probe complexity of O~(Delta^4 n^{2\/3}), and random seed of size polylog(n). This improves upon, and extends the work of [Lenzen-Levi, ICALP'18]. \nWe also complement these constructions by providing a polynomial lower bound on the probe complexity of LCAs for graph spanners that holds even for the simpler task of computing a sparse connected subgraph with o(m) edges. \nTo the best of our knowledge, our results on 3 and 5-spanners are the first LCAs with sublinear (in Delta) probe-complexity for Delta = n^{Omega(1)}.","keywords":["Local Computation Algorithms","Sub-linear Algorithms","Graph Spanners"],"author":[{"@type":"Person","name":"Parter, Merav","givenName":"Merav","familyName":"Parter","affiliation":"Weizmann IS, Rehovot, Israel","funding":"MP is supported by Minerva Foundation (124042) and ISF-2084\/18."},{"@type":"Person","name":"Rubinfeld, Ronitt","givenName":"Ronitt","familyName":"Rubinfeld","affiliation":"CSAIL, MIT, Cambridge, MA, USA and TAU, Tel Aviv, Israel","funding":"RR is supported by the NSF grants CCF-1650733, CCF-1733808, IIS-1741137 and CCF-1740751."},{"@type":"Person","name":"Vakilian, Ali","givenName":"Ali","familyName":"Vakilian","affiliation":"CSAIL, MIT, Cambridge, MA, USA","funding":"AV is supported by the NSF grant CCF-1535851."},{"@type":"Person","name":"Yodpinyanee, Anak","givenName":"Anak","familyName":"Yodpinyanee","affiliation":"CSAIL, MIT, Cambridge, MA, USA","funding":"AY is supported by the NSF grants CCF-1650733, CCF-1733808, IIS-1741137 and the DPST scholarship, Royal Thai Government."}],"position":58,"pageStart":"58:1","pageEnd":"58:21","dateCreated":"2019-01-08","datePublished":"2019-01-08","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Parter, Merav","givenName":"Merav","familyName":"Parter","affiliation":"Weizmann IS, Rehovot, Israel","funding":"MP is supported by Minerva Foundation (124042) and ISF-2084\/18."},{"@type":"Person","name":"Rubinfeld, Ronitt","givenName":"Ronitt","familyName":"Rubinfeld","affiliation":"CSAIL, MIT, Cambridge, MA, USA and TAU, Tel Aviv, Israel","funding":"RR is supported by the NSF grants CCF-1650733, CCF-1733808, IIS-1741137 and CCF-1740751."},{"@type":"Person","name":"Vakilian, Ali","givenName":"Ali","familyName":"Vakilian","affiliation":"CSAIL, MIT, Cambridge, MA, USA","funding":"AV is supported by the NSF grant CCF-1535851."},{"@type":"Person","name":"Yodpinyanee, Anak","givenName":"Anak","familyName":"Yodpinyanee","affiliation":"CSAIL, MIT, Cambridge, MA, USA","funding":"AY is supported by the NSF grants CCF-1650733, CCF-1733808, IIS-1741137 and the DPST scholarship, Royal Thai Government."}],"copyrightYear":"2019","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2019.58","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":"http:\/\/arxiv.org\/abs\/1604.07038","isPartOf":{"@type":"PublicationVolume","@id":"#volume6327","volumeNumber":124,"name":"10th Innovations in Theoretical Computer Science Conference (ITCS 2019)","dateCreated":"2019-01-08","datePublished":"2019-01-08","editor":{"@type":"Person","name":"Blum, Avrim","givenName":"Avrim","familyName":"Blum"},"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article11985","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6327"}}}