{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T23:46:50Z","timestamp":1773704810945,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540735441","type":"print"},{"value":"9783540735458","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73545-8_50","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T13:44:11Z","timestamp":1187358251000},"page":"515-525","source":"Crossref","is-referenced-by-count":4,"title":["Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families"],"prefix":"10.1007","author":[{"given":"A.","family":"Czygrinow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Ha\u0144\u0107kowiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","first-page":"364","volume-title":"FOCS","author":"B. Awerbuch","year":"1989","unstructured":"Awerbuch, B., Goldberg, A.V., Luby, M., Plotkin, S.A.: Network Decomposition and Locality in Distributed Computation. In: FOCS. Proc. 30th IEEE Symp. on Foundations of Computer Science, pp. 364\u2013369. IEEE Computer Society Press, Los Alamitos (1989)"},{"issue":"4","key":"50_CR2","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1016\/j.jda.2005.07.006","volume":"4","author":"A. Czygrinow","year":"2006","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M.: Distributed algorithms for weighted problems in sparse graphs. Journal of Discrete Algorithms\u00a04(4), 588\u2013607 (2006)","journal-title":"Journal of Discrete Algorithms"},{"key":"50_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/11841036_24","volume-title":"Algorithms \u2013 ESA 2006","author":"A. Czygrinow","year":"2006","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M.: Distributed almost exact approximations for minor-closed families. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 244\u2013255. Springer, Heidelberg (2006)"},{"key":"50_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/11758471_29","volume-title":"Algorithms and Complexity","author":"A. Czygrinow","year":"2006","unstructured":"Czygrinow, A., Ha\u0144\u0107kowiak, M., Szyma\u0144ska, E.: Distributed approximation algorithms in planar graphs, 6th Conference on Algorithms and Complexity (CIAC). In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol.\u00a03998, pp. 296\u2013307. Springer, Heidelberg (2006)"},{"key":"50_CR5","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Springer, Heidelberg (2005)","edition":"3"},{"issue":"4,132","key":"50_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1054916.1054931","volume":"35","author":"M. Elkin","year":"2004","unstructured":"Elkin, M.: An Overview of Distributed Approximation. In ACM SIGACT News Distributed Computing Column.\u00a035(4,132), 40\u201357 (2004)","journal-title":"In ACM SIGACT News Distributed Computing Column."},{"key":"50_CR7","first-page":"25","volume-title":"Constant-Time Distributed Dominating Set Approximation","author":"F. Kuhn","year":"2003","unstructured":"Kuhn, F., Wattenhofer, R.: Constant-Time Distributed Dominating Set Approximation. 22nd ACM Symposium on the Principles of Distributed Computing (PODC), pp. 25\u201332. ACM Press, New York (2003)"},{"key":"50_CR8","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1145\/1011767.1011811","volume-title":"PODC","author":"F. Kuhn","year":"2004","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: What Cannot Be Computed Locally! In: PODC. Proceedings of 23rd ACM Symposium on the Principles of Distributed Computing, pp. 300\u2013309. ACM Press, New York (2004)"},{"key":"50_CR9","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1145\/224964.224990","volume-title":"PODC","author":"S. Kutten","year":"1995","unstructured":"Kutten, S., Peleg, D.: Fast distributed construction of k-dominating sets and applications. In: PODC. Proceedings of the 14th ACM symposium on Principles of Distributed Computing, pp. 238\u2013251. ACM Press, New York (1995)"},{"issue":"1","key":"50_CR10","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"},{"issue":"4","key":"50_CR11","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(4), 1036\u20131053 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"50_CR12","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1007\/978-3-642-55566-4_29","volume-title":"Discrete and Computational Geometry, The Goodman-Pollack Festschrift","author":"J. Nesetril","year":"2003","unstructured":"Nesetril, J., de Mendez, P.O.: Colorings and homomorphisms of minor closed classes. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry, The Goodman-Pollack Festschrift. Algorithms and Combinatorics, vol.\u00a025, pp. 651\u2013664. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:15:46Z","timestamp":1605762946000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735441","9783540735458"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}