{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:31:46Z","timestamp":1725543106236},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_19","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T09:41:33Z","timestamp":1155634893000},"page":"166-175","source":"Crossref","is-referenced-by-count":1,"title":["A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem"],"prefix":"10.1007","author":[{"given":"Marc","family":"Benkert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Gudmundsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Knauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esther","family":"Moet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"van Oostrum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Benkert, M., Gudmundsson, J., Knauer, C., Moet, E., van Oostrum, R., Wolff, A.: A polynomial-time approximation algorithm for a geometric dispersion problem. Technical Report 2005-8, Universit\u00e4t Karlsruhe (May 2006), available at: http:\/\/www.ubka.uni-karlsruhe.de\/indexer-vvv\/ira\/2006\/8","DOI":"10.1007\/11809678_19"},{"key":"19_CR2","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/s00453-001-0022-x","volume":"30","author":"C. Baur","year":"2001","unstructured":"Baur, C., Fekete, S.P.: Approximation of Geometric Dispersion Problems. Algorithmica\u00a030, 450\u2013470 (2001)","journal-title":"Algorithmica"},{"key":"19_CR3","unstructured":"Cappanera, P.: A survey on obnoxious facility location problems. Technical Report TR-99-11, University of Pisa (1999)"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Chang, E.-C., Choi, S.W., Kwon, D., Park, H., Yap, C.-K.: Shortest path amidst disc obstacles is computable. In: Proceedings of the 21st ACM Symposium on Computational Geometry (2005)","DOI":"10.1145\/1064092.1064112"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"R.J. Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-compete. Information Processing Letters\u00a012, 133\u2013137 (1981)","journal-title":"Information Processing Letters"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02574677","volume":"6","author":"Z. F\u00fcredi","year":"1991","unstructured":"F\u00fcredi, Z.: The densest packing of equal circles into a parallel strip. Discrete & Computational Geometry\u00a06, 95\u2013106 (1991)","journal-title":"Discrete & Computational Geometry"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D. Hochbaum","year":"1985","unstructured":"Hochbaum, D., Maas, W.: Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI. Journal of the ACM\u00a032, 130\u2013136 (1985)","journal-title":"Journal of the ACM"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF02187683","volume":"1","author":"K. Kedem","year":"1986","unstructured":"Kedem, K., Livne, R., Pach, J., Sharir, M.: On the union of Jordan regions and collision-free translational motion admidst polygonal obstacles. Discrete & Computational Geometry\u00a01, 59\u201371 (1986)","journal-title":"Discrete & Computational Geometry"},{"key":"19_CR9","first-page":"187","volume":"128","author":"C. Maranas","year":"1995","unstructured":"Maranas, C., Floudas, C., Pardalos, P.: New results in the packing of equal circles in a square. Discrete Mathematics\u00a0128, 187\u2013293 (1995)","journal-title":"Discrete Mathematics"},{"issue":"4","key":"19_CR10","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. Journal of the ACM\u00a030(4), 852\u2013865 (1983)","journal-title":"Journal of the ACM"},{"key":"19_CR11","volume-title":"Packing and Covering","author":"C.A. Rogers","year":"1964","unstructured":"Rogers, C.A.: Packing and Covering. Cambridge University Press, Cambridge (1964)"},{"key":"19_CR12","doi-asserted-by":"crossref","DOI":"10.1201\/9781420035315","volume-title":"Handbook of Discrete and Computational Geometry","author":"G.F. T\u00f3th","year":"2004","unstructured":"T\u00f3th, G.F.: Packing and Covering. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., CRC Press LLC, Boca Raton (2004)","edition":"2"},{"key":"19_CR13","volume-title":"Sphere Packings","author":"C. Zong","year":"1999","unstructured":"Zong, C., Talbot, J.: Sphere Packings. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T10:38:30Z","timestamp":1683542310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11809678_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}