{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T00:44:43Z","timestamp":1792111483300,"version":"4.4.0"},"publisher-location":"New York, NY","reference-count":11,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_209","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:20Z","timestamp":1461269000000},"page":"1129-1132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Local Approximation of Covering and Packing Problems"],"prefix":"10.1007","author":[{"given":"Fabian","family":"Kuhn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"key":"209_CR12295","doi-asserted-by":"crossref","unstructured":"Bartal Y, Byers JW, Raz D (1997) Global optimization using local information with applications to flow control. In: Proceedings of the 38th IEEE symposium on the foundations of computer science (FOCS), pp 303\u2013312","DOI":"10.1109\/SFCS.1997.646119"},{"key":"209_CR12296","doi-asserted-by":"crossref","unstructured":"Kuhn F, Moscibroda T, Wattenhofer R (2004) What cannot be computed locally! In: Proceedings of the 23rd ACM symposium on principles of distributed computing (PODC), pp 300\u2013309","DOI":"10.1145\/1011767.1011811"},{"key":"209_CR12297","doi-asserted-by":"crossref","unstructured":"Kuhn F, Moscibroda T, Nieberg T, Wattenhofer R (2005) Fast deterministic distributed maximal independent set computation on growth-bounded graphs. In: Proceedings of the 19th international conference on distributed computing (DISC), pp 273\u2013287","DOI":"10.1007\/11561927_21"},{"key":"209_CR12298","doi-asserted-by":"crossref","unstructured":"Kuhn F, Moscibroda T, Nieberg T, Wattenhofer R (2005) Local approximation schemes for ad hoc and sensor networks. In: Proceedings of the 3rd joint workshop on foundations of mobile computing (DIALM-POMC), pp 97\u2013103","DOI":"10.1145\/1080810.1080827"},{"key":"209_CR12299","doi-asserted-by":"crossref","unstructured":"Kuhn F, Moscibroda T, Wattenhofer R (2005) On the locality of bounded growth. In: Proceedings of the 24th ACM symposium on principles of distributed computing (PODC), pp 60\u201368","DOI":"10.1145\/1073814.1073826"},{"issue":"4","key":"209_CR12300","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 (2005) Constant-time distributed dominating set approximation. Distrib Comput 17(4):303\u2013310","journal-title":"Distrib Comput"},{"key":"209_CR12301","doi-asserted-by":"crossref","unstructured":"Kuhn F, Moscibroda T, Wattenhofer R (2006) The price of being near-sighted. In: Proceedings of the 17th ACM-SIAM symposium on discrete algorithms (SODA), pp 980\u2013989","DOI":"10.1145\/1109557.1109666"},{"issue":"1","key":"209_CR12302","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N Linial","year":"1992","unstructured":"Linial N (1992) Locality in distributed graph algorithms. SIAM J Comput 21(1):193\u2013201","journal-title":"SIAM J Comput"},{"key":"209_CR12303","doi-asserted-by":"crossref","unstructured":"Naor M, Stockmeyer L (1993) What can be computed locally? In: Proceedings of the 25th annual ACM symposium on theory of computing (STOC), pp 184\u2013193","DOI":"10.1145\/167088.167149"},{"key":"209_CR12304","doi-asserted-by":"crossref","unstructured":"Papadimitriou C, Yannakakis M (1993) Linear programming without the matrix. In: Proceedings of the 25th ACM symposium on theory of computing (STOC), pp 121\u2013129","DOI":"10.1145\/167088.167127"},{"key":"209_CR12305","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 (2000) Distributed computing: a locality-sensitive approach. SIAM"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_209","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:56:41Z","timestamp":1792108601000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_209"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_209","relation":{},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}