{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T07:12:14Z","timestamp":1775286734218,"version":"3.50.1"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046927","type":"print"},{"value":"9783030046934","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04693-4_12","type":"book-chapter","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T00:03:12Z","timestamp":1543363392000},"page":"181-203","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sublinear Graph Augmentation for Fast Query Implementation"],"prefix":"10.1007","author":[{"given":"Artur","family":"Czumaj","sequence":"first","affiliation":[]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[]},{"given":"Shai","family":"Vardi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,29]]},"reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/s00453-007-9075-9","volume":"51","author":"N Ailon","year":"2008","unstructured":"Ailon, N., Chazelle, B., Comandur, S., Liu, D.: Property-preserving data reconstruction. Algorithmica 51(2), 160\u2013182 (2008)","journal-title":"Algorithmica"},{"key":"12_CR2","first-page":"243","volume":"17","author":"DJ Aldous","year":"1983","unstructured":"Aldous, D.J.: Random walks on finite groups and rapidly mixing Markov chains. S\u00e9minaire de probabilit\u00e9s de Strasbourg 17, 243\u2013297 (1983). http:\/\/eudml.org\/doc\/113445","journal-title":"S\u00e9minaire de probabilit\u00e9s de Strasbourg"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"1132","DOI":"10.1137\/1.9781611973099.89","volume-title":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Noga Alon","year":"2012","unstructured":"Alon, N., Rubinfeld, R., Vardi, S., Xie, N.: Space-efficient local computation algorithms. In: Proceedings of 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1132\u20131139 (2012)"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02189308","volume":"9","author":"I Alth\u00f6fer","year":"1993","unstructured":"Alth\u00f6fer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete Comput. Geom. 9(1), 81\u2013100 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Bencz\u00far, A.A., Karger, D.R.: Approximating s-t minimum cuts in \u00d5(n2) time. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC 1996, pp. 47\u201355 (1996)","DOI":"10.1145\/237814.237827"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Chechik, S.: Approximate distance oracles with constant query time. In: Symposium on Theory of Computing, STOC, pp. 654\u2013663 (2014)","DOI":"10.1145\/2591796.2591801"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Monemizadeh, M., Onak, K., Sohler, C.: Planar graphs: random walks and bipartiteness testing. In: Proceedings of 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 423\u2013432 (2011)","DOI":"10.1109\/FOCS.2011.69"},{"key":"12_CR8","unstructured":"Even, G., Medina, M., Ron, D.: Best of two local models: local centralized and local distributed algorithms. CoRR abs\/1402.3796 (2014). http:\/\/arxiv.org\/abs\/1402.3796"},{"key":"12_CR9","unstructured":"Feige, U., Patt-Shamir, B., Vardi, S.: On the probe complexity of local computation algorithms. CoRR abs\/1703.07734 (2017). http:\/\/arxiv.org\/abs\/1703.07734"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Filtser, A., Solomon, S.: The greedy spanner is existentially optimal. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC, pp. 9\u201317 (2016)","DOI":"10.1145\/2933057.2933114"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Heinrich, M., Kosowski, A.: Local conflict coloring. In: IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS, pp. 625\u2013634 (2016)","DOI":"10.1109\/FOCS.2016.73"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Fung, W.S., Hariharan, R., Harvey, N.J.A., Panigrahi, D.: A general framework for graph sparsification. In: Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6\u20138 June 2011, pp. 71\u201380 (2011)","DOI":"10.1145\/1993636.1993647"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Ghaffari, M.: An improved distributed algorithm for maximal independent set. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, pp. 270\u2013277 (2016)","DOI":"10.1137\/1.9781611974331.ch20"},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s004930050060","volume":"19","author":"O Goldreich","year":"1999","unstructured":"Goldreich, O., Ron, D.: A sublinear bipartiteness tester for bounded degree graphs. Combinatorica 19(3), 335\u2013373 (1999)","journal-title":"Combinatorica"},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s00453-001-0078-7","volume":"32","author":"O Goldreich","year":"2002","unstructured":"Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica 32(2), 302\u2013343 (2002)","journal-title":"Algorithmica"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-662-53426-7_15","volume-title":"Distributed Computing","author":"M G\u00f6\u00f6s","year":"2016","unstructured":"G\u00f6\u00f6s, M., Hirvonen, J., Levi, R., Medina, M., Suomela, J.: Non-local probes do not help with many graph problems. In: Gavoille, C., Ilcinkas, D. (eds.) DISC 2016. LNCS, vol. 9888, pp. 201\u2013214. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53426-7_15"},{"issue":"4","key":"12_CR17","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/2956584","volume":"4","author":"A Hassidim","year":"2016","unstructured":"Hassidim, A., Mansour, Y., Vardi, S.: Local computation mechanism design. ACM Trans. Econ. Comput. 4(4), 21:1\u201321:24 (2016). https:\/\/doi.org\/10.1145\/2956584","journal-title":"ACM Trans. Econ. Comput."},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Katz, J., Trevisan, L.: On the efficiency of local decoding procedures for error-correcting codes. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 80\u201386 (2000)","DOI":"10.1145\/335305.335315"},{"issue":"6","key":"12_CR19","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1137\/S0097539703436424","volume":"33","author":"T Kaufman","year":"2004","unstructured":"Kaufman, T., Krivelevich, M., Ron, D.: Tight bounds for testing bipartiteness in general graphs. SIAM J. Comput. 33(6), 1441\u20131483 (2004)","journal-title":"SIAM J. Comput."},{"key":"12_CR20","unstructured":"Lenzen, C., Levi, R.: A local algorithm for the sparse spanning graph problem. CoRR abs\/1703.05418 (2017). http:\/\/arxiv.org\/abs\/1703.05418"},{"key":"12_CR21","unstructured":"Levi, R., Ron, D., Rubinfeld, R.: Local algorithms for sparse spanning graphs. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2014, pp. 826\u2013842 (2014)"},{"key":"12_CR22","unstructured":"Levi, R., Ron, D., Rubinfeld, R.: A local algorithm for constructing spanners in minor-free graphs. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM, pp. 38:1\u201338:15 (2016)"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Levi, R., Rubinfeld, R., Yodpinyanee, A.: Brief announcement: local computation algorithms for graphs of non-constant degrees. In: Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA, pp. 59\u201361 (2015)","DOI":"10.1145\/2755573.2755615"},{"issue":"2","key":"12_CR24","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/3152042.3152053","volume":"45","author":"Palma London","year":"2017","unstructured":"London, P., Chen, N., Vardi, S., Wierman, A.: Distributed optimization via local computation algorithms (2017). http:\/\/users.cms.caltech.edu\/~plondon\/loco.pdf","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-319-28684-6_10","volume-title":"Approximation and Online Algorithms","author":"Y Mansour","year":"2015","unstructured":"Mansour, Y., Patt-Shamir, B., Vardi, S.: Constant-time local computation algorithms. In: Sanit\u00e0, L., Skutella, M. (eds.) WAOA 2015. LNCS, vol. 9499, pp. 110\u2013121. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-28684-6_10"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-642-31594-7_55","volume-title":"Automata, Languages, and Programming","author":"Y Mansour","year":"2012","unstructured":"Mansour, Y., Rubinstein, A., Vardi, S., Xie, N.: Converting online algorithms to local computation algorithms. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7391, pp. 653\u2013664. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31594-7_55"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-40328-6_19","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Y Mansour","year":"2013","unstructured":"Mansour, Y., Vardi, S.: A local computation approximation scheme to maximum matching. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds.) APPROX\/RANDOM -2013. LNCS, vol. 8096, pp. 260\u2013273. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40328-6_19"},{"key":"12_CR28","series-title":"Monographs on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2000)"},{"issue":"1","key":"12_CR29","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D Peleg","year":"1989","unstructured":"Peleg, D., Sch\u00e4ffer, A.A.: Graph spanners. J. Graph Theory 13(1), 99\u2013116 (1989)","journal-title":"J. Graph Theory"},{"issue":"3","key":"12_CR30","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D Peleg","year":"1989","unstructured":"Peleg, D., Upfal, E.: A trade-off between space and efficiency for routing tables. J. ACM 36(3), 510\u2013530 (1989)","journal-title":"J. ACM"},{"issue":"7","key":"12_CR31","doi-asserted-by":"publisher","first-page":"1180","DOI":"10.1016\/j.jcss.2016.05.007","volume":"82","author":"O Reingold","year":"2016","unstructured":"Reingold, O., Vardi, S.: New techniques and tighter bounds for local computation algorithms. J. Comput. Syst. Sci. 82(7), 1180\u20131200 (2016)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR32","unstructured":"Rubinfeld, R., Tamir, G., Vardi, S., Xie, N.: Fast local computation algorithms. In: Proceedings of 2nd Symposium on Innovations in Computer Science (ICS), pp. 223\u2013238 (2011)"},{"issue":"7","key":"12_CR33","doi-asserted-by":"publisher","first-page":"2897","DOI":"10.1137\/080728561","volume":"39","author":"ME Saks","year":"2010","unstructured":"Saks, M.E., Seshadhri, C.: Local monotonicity reconstruction. SIAM J. Comput. 39(7), 2897\u20132926 (2010)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"12_CR34","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","volume":"82","author":"A Sinclair","year":"1989","unstructured":"Sinclair, A., Jerrum, M.: Approximate counting, uniform generation and rapidly mixing Markov chains. Inf. Comput. 82(1), 93\u2013133 (1989)","journal-title":"Inf. Comput."},{"issue":"6","key":"12_CR35","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1137\/080734029","volume":"40","author":"DA Spielman","year":"2011","unstructured":"Spielman, D.A., Srivastava, N.: Graph sparsification by effective resistances. SIAM J. Comput. 40(6), 1913\u20131926 (2011)","journal-title":"SIAM J. Comput."},{"key":"12_CR36","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, (STOC), pp. 183\u2013192 (2001)","DOI":"10.1145\/380752.380798"},{"key":"12_CR37","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: SPAA, pp. 1\u201310 (2001)","DOI":"10.1145\/378580.378581"},{"key":"12_CR38","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1137\/1.9781611973099.18","volume-title":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Christian Wulff-Nilsen","year":"2012","unstructured":"Wulff-Nilsen, C.: Approximate distance oracles with improved preprocessing time. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 202\u2013208 (2012)"},{"issue":"3","key":"12_CR39","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1561\/0400000030","volume":"6","author":"S Yekhanin","year":"2012","unstructured":"Yekhanin, S.: Locally decodable codes. Found. Trends Theor. Comput. Sci. 6(3), 139\u2013255 (2012)","journal-title":"Found. Trends Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04693-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:24:54Z","timestamp":1775283894000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04693-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046927","9783030046934"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04693-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Helsinki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/algo2018.hiit.fi\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}