{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:39Z","timestamp":1759637979767,"version":"3.41.0"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319252575"},{"type":"electronic","value":"9783319252582"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","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":[[2015]]},"DOI":"10.1007\/978-3-319-25258-2_15","type":"book-chapter","created":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T07:10:18Z","timestamp":1445238618000},"page":"209-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation"],"prefix":"10.1007","author":[{"given":"Leonid","family":"Barenboim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Elkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,20]]},"reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1006\/jpdc.1996.0159","volume":"39","author":"B. Awerbuch","year":"1996","unstructured":"Awerbuch, B., Berger, B., Cowen, L., Peleg, D.: Fast Distributed Network Decompositions and Covers. J. of Parallel and Distr. Computing\u00a039(2), 105\u2013114 (1996)","journal-title":"J. of Parallel and Distr. Computing"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/0097-3165(80)90030-8","volume":"29","author":"M. Ajtai","year":"1980","unstructured":"Ajtai, M., Komlos, J., Szemeredi, E.: A note on Ramsey numbers. Journal of Combinatorial Theory, Series A\u00a029, 354\u2013360 (1980)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.: Network decomposition and locality in distributed computation. In: Proc. of the 30th Annual Symposium on Foundations of Computer Science, pp. 364\u2013369 (1989)","DOI":"10.1109\/SFCS.1989.63504"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Peleg, D.: Sparse partitions. In: Proc. of the 31st IEEE Symp. on Foundations of Computer Science, pp. 503\u2013513 (1990)","DOI":"10.1109\/FSCS.1990.89571"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-31585-5_37","volume-title":"Automata, Languages, and Programming","author":"L. Barenboim","year":"2012","unstructured":"Barenboim, L.: On the locality of some NP-complete problems. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol.\u00a07392, pp. 403\u2013415. Springer, Heidelberg (2012)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M.: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. In: Proc. of the 27th ACM Symp. on Principles of Distributed Computing, pp. 25\u201334 (2008)","DOI":"10.1145\/1400751.1400757"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M.: Distributed (\u0394\u2009+\u20091)-coloring in linear (in \u0394) time. In: Proc. of the 41st ACM Symp. on Theory of Computing, pp. 111\u2013120 (2009)","DOI":"10.1145\/1536414.1536432"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M.: Deterministic distributed vertex coloring in polylogarithmic time. In: Proc. 29th ACM Symp. on Principles of Distributed Computing, pp. 410\u2013419 (2010)","DOI":"10.1145\/1835698.1835797"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M.: Distributed Graph Coloring: Fundamentals and Recent Developments. Morgan-Claypool Synthesis Lectures on Distributed Computing Theory (2013)","DOI":"10.2200\/S00520ED1V01Y201307DCT011"},{"key":"15_CR10","unstructured":"Barenboim, L., Elkin, M., Gavoille, C.: A Fast Network-Decomposition Algorithm and its Applications to Constant-Time Distributed Computation, http:\/\/arxiv.org\/abs\/1505.05697"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Barenboim, L., Elkin, M., Pettie, S., Schneider, J.: The locality of distributed symmetry breaking. In: Proc. of the 53rd Annual Symposium on Foundations of Computer Science, pp. 321\u2013330 (2012)","DOI":"10.1109\/FOCS.2012.60"},{"issue":"4","key":"15_CR12","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1002\/rsa.20130","volume":"30","author":"S. Baswana","year":"2007","unstructured":"Baswana, S., Sen, S.: A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Structures and Algorithms\u00a030(4), 532\u2013563 (2007)","journal-title":"Random Structures and Algorithms"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22006-7_1","volume-title":"Automata, Languages and Programming","author":"P. Berman","year":"2011","unstructured":"Berman, P., Bhattacharyya, A., Makarychev, K., Raskhodnikova, S., Yaroslavtsev, G.: Improved approximation for the directed spanner problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol.\u00a06755, pp. 1\u201312. Springer, Heidelberg (2011)"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Bisht, T., Kothapalli, K., Pemmaraju, S.: Super-fast t-ruling sets (Brief Announcement). In: Proc. of the 33th ACM Symposium on Principles of Distributed Computing, pp. 379\u2013381 (2014)","DOI":"10.1145\/2611462.2611512"},{"key":"15_CR15","unstructured":"Bollobas, B.: Extremal Graph Theory. Dover Publications (2004)"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Busch, C., Dutta, C., Radhakrishnan, J., Rajaraman, R., Srinivasagopalan, S.: Split and join: strong partitions and universal Steiner trees for graphs. In: Proc. of 53rd Annual IEEE Symp. on Foundations of Computer Science, pp. 81\u201390 (2012)","DOI":"10.1109\/FOCS.2012.45"},{"issue":"1","key":"15_CR17","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","volume":"70","author":"R. Cole","year":"1986","unstructured":"Cole, R., Vishkin, U.: Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control\u00a070(1), 32\u201353 (1986)","journal-title":"Information and Control"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Derbel, B., Gavoille, C., Peleg, D., Viennot, L.: On the locality of distributed sparse spanner construction. In: Proc. of the 27th ACM Symp. on Principles of Distributed Computing, pp. 273\u2013282 (2008)","DOI":"10.1145\/1400751.1400788"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Dinitz, M., Krauthgamer, R.: Directed spanners via flow-based linear programs. In: Proc. of the 43rd ACM Symp. on Theory of Computing, pp. 323\u2013332 (2011)","DOI":"10.1145\/1993636.1993680"},{"issue":"4","key":"15_CR20","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.jcss.2005.04.002","volume":"71","author":"D. Dubhashi","year":"2005","unstructured":"Dubhashi, D., Mei, A., Panconesi, A., Radhakrishnan, J., Srinivasan, A.: Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. Journal of Computer and System Sciences\u00a071(4), 467\u2013479 (2005)","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Elkin, M.: A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners. In: Proc. of the 26th ACM Symp. on Principles of Distributed Computing, pp. 185\u2013194 (2007)","DOI":"10.1145\/1281100.1281128"},{"key":"15_CR22","unstructured":"Elkin, M., Peleg, D.: The client-server 2-spanner problem with applications to network design. In: Proc. of the 8th International Colloquium on Structural Information and Communication Complexity, pp. 117\u2013132 (2001)"},{"issue":"1-3","key":"15_CR23","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.tcs.2004.11.022","volume":"337","author":"M. Elkin","year":"2005","unstructured":"Elkin, M., Peleg, D.: Approximating k-spanner problems for k\u2009\u2265\u20092. Theoretical Computer Science\u00a0337(1-3), 249\u2013277 (2005)","journal-title":"Theoretical Computer Science"},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/BF02772959","volume":"51","author":"P. Erd\u0151s","year":"1985","unstructured":"Erd\u0151s, P., Frankl, P., F\u00fcredi, Z.: Families of finite sets in which no set is covered by the union of r others. Israel Journal of Mathematics\u00a051, 79\u201389 (1985)","journal-title":"Israel Journal of Mathematics"},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jcss.1998.1587","volume":"57","author":"U. Feige","year":"1998","unstructured":"Feige, U., Kilian, J.: Zero Knowledge and the chromatic number. Journal of Computer and System Sciences\u00a057, 187\u2013199 (1998)","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Gfeller, B., Vicari, E.: A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. In: Proc. of the 26th ACM Symp. on Principles of Distributed Computing, pp. 53\u201360 (2007)","DOI":"10.1145\/1281100.1281111"},{"issue":"4","key":"15_CR27","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1137\/0401044","volume":"1","author":"A. Goldberg","year":"1988","unstructured":"Goldberg, A., Plotkin, S., Shannon, G.: Parallel symmetry-breaking in sparse graphs. SIAM Journal on Discrete Mathematics\u00a01(4), 434\u2013446 (1988)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Hastad, J.: Clique is Hard to Approximate Within n 1\u2009\u2212\u2009\u03b5 . In: Proc. of the 37th Annual Symposium on Foundations of Computer Science, pp. 627\u2013636 (1996)","DOI":"10.1109\/SFCS.1996.548522"},{"key":"15_CR29","unstructured":"Jia, L., Rajaraman, R., Suel, R.: An efficient distributed algorithm for constructing small dominating sets. In: Proc. of the 20th ACM Symp. on Principles of Distributed Computing, pp. 33\u201342 (2001)"},{"key":"15_CR30","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/rsa.3240070302","volume":"7","author":"J.H. Kim","year":"1995","unstructured":"Kim, J.H.: The Ramsey number R(3,t) has order of magnitude t 2\/ logt. Random Structures and Algorithms\u00a07, 173\u2013207 (1995)","journal-title":"Random Structures and Algorithms"},{"issue":"2","key":"15_CR31","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1006\/jagm.1994.1032","volume":"17","author":"G. Kortsarz","year":"1994","unstructured":"Kortsarz, G., Peleg, D.: Generating sparse 2-spanners. Journal of Algorithms\u00a017(2), 222\u2013236 (1994)","journal-title":"Journal of Algorithms"},{"key":"15_CR32","unstructured":"Kothapalli, K., Pemmaraju, S.: Super-fast 3-ruling sets. In: Proc. of the 32nd IARCS International Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 136\u2013147 (2012)"},{"key":"15_CR33","doi-asserted-by":"crossref","unstructured":"Kuhn, F.: Weak graph colorings: distributed algorithms and applications. In: Proc. of the 21st ACM Symposium on Parallel Algorithms and Architectures, pp. 138\u2013144 (2009)","DOI":"10.1145\/1583991.1584032"},{"key":"15_CR34","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the locality of bounded growth. In: Proc. of the 24th ACM Symp. on Principles of Distributed Computing, pp. 60\u201368 (2005)","DOI":"10.1145\/1073814.1073826"},{"issue":"4","key":"15_CR35","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s00446-004-0112-5","volume":"17","author":"F. Kuhn","year":"2005","unstructured":"Kuhn, F., Wattenhofer, R.: Constant-time distributed dominating set approximation. Distributed Computing\u00a017(4), 303\u2013310 (2005)","journal-title":"Distributed Computing"},{"key":"15_CR36","first-page":"469","volume-title":"Lecture Notes in Computer Science","author":"Shay Kutten","year":"2014","unstructured":"Kutten, S., Nanongkai, D., Pandurangan, G., Robinson, P.: Distributed symmetry breaking in hypergraphs. In: Proc. of the 28th International Symposium on Distributed Computing, pp. 469\u2013483 (2014)"},{"key":"15_CR37","unstructured":"Lenzen, C., Oswald, Y., Wattenhofer, R.: What can be approximated locally? case study: dominating sets in planar graphs. In: Proc 20th ACM Symp. on Parallelism in Algorithms and Architectures, pp. 46\u201354 (2010). See also TIK report number 331, ETH Zurich, 2010"},{"key":"15_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/978-3-642-15763-9_48","volume-title":"Distributed Computing","author":"C. Lenzen","year":"2010","unstructured":"Lenzen, C., Wattenhofer, R.: Minimum dominating set approximation in graphs of bounded arboricity. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 510\u2013524. Springer, Heidelberg (2010)"},{"issue":"1","key":"15_CR39","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM Journal on Computing\u00a021(1), 193\u2013201 (1992)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR40","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/BF01303516","volume":"13","author":"N. Linial","year":"1993","unstructured":"Linial, N., Saks, M.: Low diameter graph decomposition. Combinatorica\u00a013, 441\u2013454 (1993)","journal-title":"Combinatorica"},{"key":"15_CR41","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M. Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing\u00a015, 1036\u20131053 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"15_CR42","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511813603"},{"key":"15_CR43","doi-asserted-by":"crossref","unstructured":"Nanongkai, D.: Distributed approximation algorithms for weighted shortest paths. In: Proc. of the 46th ACM Symp. on Theory of Computing, pp. 565\u2013573 (2014)","DOI":"10.1145\/2591796.2591850"},{"key":"15_CR44","doi-asserted-by":"crossref","unstructured":"Naor, M., Stockmeyer, L.: What can be computed locally? In: Proc. 25th ACM Symp. on Theory of Computing, pp. 184\u2013193 (1993)","DOI":"10.1145\/167088.167149"},{"issue":"2","key":"15_CR45","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/PL00008932","volume":"14","author":"A. Panconesi","year":"2001","unstructured":"Panconesi, A., Rizzi, R.: Some simple distributed algorithms for sparse networks. Distributed Computing\u00a014(2), 97\u2013100 (2001)","journal-title":"Distributed Computing"},{"issue":"2","key":"15_CR46","first-page":"581","volume":"20","author":"A. Panconesi","year":"1995","unstructured":"Panconesi, A., Srinivasan, A.: On the complexity of distributed network decomposition. Journal of Algorithms\u00a020(2), 581\u2013592 (1995)","journal-title":"Journal of Algorithms"},{"key":"15_CR47","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/978-3-642-32512-0_25","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Rishi Saket","year":"2012","unstructured":"Saket, R., Sviridenko, M.: New and improved bounds for the minimum set cover problem. In: Gupta, A., Jansen, K., Rolim, J., Servedio, R. (eds.) APPROX\/RANDOM 2012. LNCS, vol.\u00a07408, pp. 288\u2013300. Springer, Heidelberg (2012)"},{"key":"15_CR48","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.tcs.2012.09.004","volume":"509","author":"J. Schneider","year":"2013","unstructured":"Schneider, J., Elkin, M., Wattenhofer, R.: Symmetry breaking depending on the chromatic number or the neighborhood growth. Theoretical Computer Science\u00a0509, 40\u201350 (2013)","journal-title":"Theoretical Computer Science"},{"key":"15_CR49","doi-asserted-by":"crossref","unstructured":"Schneider, J., Wattenhofer, R.: A log-star distributed maximal independent set algorithm for growth bounded graphs. In: Proc. of the 27th ACM Symp. on Principles of Distributed Computing, pp. 35\u201344 (2008)","DOI":"10.1145\/1400751.1400758"},{"issue":"1","key":"15_CR50","doi-asserted-by":"publisher","first-page":"103","DOI":"10.4086\/toc.2007.v003a006","volume":"3","author":"D. Zuckerman","year":"2007","unstructured":"Zuckerman, D.: Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number. Theory of Computing\u00a03(1), 103\u2013128 (2007)","journal-title":"Theory of Computing"},{"key":"15_CR51","unstructured":"http:\/\/www.disco.ethz.ch\/lectures\/ss04\/distcomp\/lecture\/chapter12.pdf"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25258-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T02:17:37Z","timestamp":1748657857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25258-2_15"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319252575","9783319252582"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25258-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}