{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T00:33:44Z","timestamp":1794357224153,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":11,"publisher":"Springer US","isbn-type":[{"value":"9780387307701","type":"print"},{"value":"9780387301624","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_209","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T14:35:05Z","timestamp":1214490905000},"page":"463-466","source":"Crossref","is-referenced-by-count":1,"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","reference":[{"key":"209_CR1_209","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Byers, J.W., Raz, D.: Global optimization using local information with applications to flow control. In: Proc. of the 38th IEEE Symposium on the Foundations of Computer Science (FOCS), pp.\u00a0303\u2013312 (1997)","DOI":"10.1109\/SFCS.1997.646119"},{"key":"209_CR2_209","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: What cannot be computed locally! In: Proc. of the 23rd ACM Symp. on Principles of Distributed Computing (PODC), pp.\u00a0300\u2013309 (2004)","DOI":"10.1145\/1011767.1011811"},{"key":"209_CR3_209","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Fast deterministic distributed maximal independent set computation on growth-bounded graphs. In: Proc. of th 19th Int. Conference on Distributed Computing (DISC), pp.\u00a0273\u2013287 (2005)","DOI":"10.1007\/11561927_21"},{"key":"209_CR4_209","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Local approximation schemes for ad hoc and sensor networks. In: Proc. of the 3rd Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pp.\u00a097\u2013103 (2005)","DOI":"10.1145\/1080810.1080827"},{"key":"209_CR5_209","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: On the locality of bounded growth. In: Proc. of the 24th ACM Symposium on Principles of Distributed Computing (PODC), pp.\u00a060\u201368 (2005)","DOI":"10.1145\/1073814.1073826"},{"issue":"4","key":"209_CR6_209","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. Distrib. Comput. 17(4), 303\u2013310 (2005)","journal-title":"Distrib. Comput."},{"key":"209_CR7_209","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: Proc. of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0980\u2013989 (2006)","DOI":"10.1145\/1109557.1109666"},{"issue":"1","key":"209_CR8_209","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 J. Comput. 21(1), 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"key":"209_CR9_209","doi-asserted-by":"crossref","unstructured":"Naor, M., Stockmeyer, L.: What can be computed locally? In: Proc. of the 25th Annual ACM Symposium on Theory of Computing (STOC), pp.\u00a0184\u2013193 (1993)","DOI":"10.1145\/167088.167149"},{"key":"209_CR10_209","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Yannakakis, M.: Linear programming without the matrix. In: Proc. of the 25th ACM Symposium on Theory of Computing (STOC), pp.\u00a0121\u2013129 (1993)","DOI":"10.1145\/167088.167127"},{"key":"209_CR11_209","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A\u00a0Locality-Sensitive Approach. SIAM (2000)","DOI":"10.1137\/1.9780898719772"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_209","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T16:32:21Z","timestamp":1738254741000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_209"}},"subtitle":["2003\u20132006; Kuhn, Moscibroda, Nieberg, Wattenhofer"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_209","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008]]}}}