{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:13:49Z","timestamp":1725484429395},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438663"},{"type":"electronic","value":"9783540454717"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45471-3_10","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T17:18:22Z","timestamp":1179767902000},"page":"90-99","source":"Crossref","is-referenced-by-count":8,"title":["Exact Algorithms and Approximation Schemes for Base Station Placement Problems"],"prefix":"10.1007","author":[{"given":"Nissan","family":"Lev-Tov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"M. Charikar and R. Panigary. Clustering to minimize the sum of cluster diameters. In Proc. 33rd ACM Symp. on Theory of Computing, July 2001.","DOI":"10.1145\/380752.380753"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B.N. Clark","year":"1990","unstructured":"B.N. Clark, C.J. Colbourn, and D.S. Johnson. Unit disk graphs. Discrete Mathematics, 86:165\u2013177, 1990.","journal-title":"Discrete Mathematics"},{"key":"10_CR3","unstructured":"T. Erlebach, K. Jansen, and E. Seidel. Polynomial-time approximation schemes for geometric graphs. In Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, 2001."},{"key":"10_CR4","unstructured":"C. Glasser, S. Reith, and H. Vollmer. The complexity of base station positioning in cellular networks. In Proc. ICALP Workshops, 167\u2013177. Carleton Press, 2000."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"D.S. Hochbaum and W. Maas. Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM, 32:130\u2013136, 1985.","journal-title":"J. ACM"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1006\/jagm.1997.0903","volume":"26","author":"H.B. Hunt","year":"1998","unstructured":"H.B Hunt, S.S. Ravi, M.V. Marathe, D.J. Rosenkrantz, V. Radhakrishnan, and R.E. Stearns. NC-approximation schemes for NP-and PSPACE-hard problems for geometric graphs. Journal of Algorithms, 26(2):238\u2013274, 1998.","journal-title":"Journal of Algorithms"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01185335","volume":"9","author":"R.Z. Hwang","year":"1993","unstructured":"R.Z Hwang, R.C.T Lee, and R.C. Chang. The slab dividing approach to solve the Euclidian p-center problem. Algorithmica, 9:1\u201322, 1993.","journal-title":"Algorithmica"},{"issue":"2","key":"10_CR8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"R.J. Lipton and R.E. Tarjan. A separator theorem for planar graphs. SIAM J. on Applied Math., 36(2):177\u2013189, April 1979.","journal-title":"SIAM J. on Applied Math."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45471-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T20:50:02Z","timestamp":1550350202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45471-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438663","9783540454717"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-45471-3_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}