{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:07Z","timestamp":1725664087001},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575290"},{"type":"electronic","value":"9783540482116"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[[1993]]},"DOI":"10.1007\/3-540-57529-4_57","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:05:58Z","timestamp":1330243558000},"page":"238-247","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Compact location problems"],"prefix":"10.1007","author":[{"given":"Venkatesh","family":"Radhakrishnan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven O.","family":"Krumke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madhav V.","family":"Marathe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel J.","family":"Rosenkrantz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. S.","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"No.1","key":"19_CR1","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0196-6774(91)90022-Q","volume":"12","author":"A. Aggarwal","year":"1991","unstructured":"A. Aggarwal, H. Imai, N. Katoh and S. Suri, \u201cFinding k points with Minimum Diameter and Related Problems,\u201d J. Algorithms, Vol. 12, No. 1, March 1991, pp 38\u201356.","journal-title":"J. Algorithms"},{"key":"19_CR2","volume-title":"Introduction to Mathematical Techniques in Pattern Recognition","author":"H. C. Andrews","year":"1972","unstructured":"H. C. Andrews, Introduction to Mathematical Techniques in Pattern Recognition, Wiley-Interscience, New York, NY, 1972."},{"key":"19_CR3","first-page":"343","volume":"519","author":"J. Bar-Ilan","year":"1991","unstructured":"J. Bar-Ilan and D. Peleg, \u201cApproximation algorithms for selecting network centers (Preliminary version),\u201d 2nd WADS '91 LNCS Vol. 519, Aug. 1991, pp 343\u2013354.","journal-title":"2nd WADS '91 LNCS"},{"issue":"No.6","key":"19_CR4","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0167-6377(85)90002-1","volume":"3","author":"M.E. Dyer","year":"1985","unstructured":"M.E. Dyer and A.M. Frieze, \u201cA Simple Heuristic for the p-Center Problem,\u201d Operations Research Letters, Vol. 3, No. 6, Feb. 1985, pp. 285\u2013288.","journal-title":"Operations Research Letters"},{"key":"19_CR5","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0377-2217(89)90420-7","volume":"40","author":"E. Erkut","year":"1989","unstructured":"E. Erkut and S. Neuman, \u201cAnalytical Models for Locating Undesirable Facilities,\u201d European J. of Operations Research, Vol. 40, 1989, pp 275\u2013291.","journal-title":"European J. of Operations Research"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"T. Feder and D. Greene, \u201cOptimal Algorithms for Approximate Clustering\u201d, ACM Symposium on Theory of Computing, 1988, pp 434\u2013444.","DOI":"10.1145\/62212.62255"},{"key":"19_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., San Francisco, CA, 1979."},{"key":"19_CR8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T.F. Gonzalez","year":"1985","unstructured":"T.F. Gonzalez, \u201cClustering to Minimize the Maximum Intercluster Distance\u201d, Theoretical Computer Science, Vol. 38, 1985, pp 293\u2013306.","journal-title":"Theoretical Computer Science"},{"key":"19_CR9","volume-title":"Clustering Algorithms","author":"J. A. Hartigan","year":"1975","unstructured":"J. A. Hartigan, Clustering Algorithms, Wiley, New York, NY, 1975."},{"issue":"No.3","key":"19_CR10","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/5925.5933","volume":"33","author":"D. S. Hochbaum","year":"1986","unstructured":"D. S. Hochbaum and D. B. Shmoys, \u201cA Unified Approach to Approximation Algorithms for Bottleneck Problems,\u201d JACM, Vol. 33, No. 3, July 1986, pp 533\u2013550.","journal-title":"JACM"},{"key":"19_CR11","volume-title":"An Introduction to Parallel Algorithms","author":"J. JaJa","year":"1992","unstructured":"J. JaJa, An Introduction to Parallel Algorithms, Addison-Wesley Publishing Co., New York, NY, 1992."},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1109\/TC.1982.1676031","volume":"C-31","author":"D. T. Lee","year":"1982","unstructured":"D. T. Lee, \u201cOn k-nearest neighbor Voronoi diagrams in the plane,\u201d IEEE Trans. Comput., Vol. C-31, 1982, pp 478\u2013487.","journal-title":"IEEE Trans. Comput."},{"key":"19_CR13","unstructured":"J.-H. Lin and J. S. Vitter, \u201c\u03b5-approximations with minimum packing constraint violation,\u201d Proc, 24th Annual ACM STOC (1992), pp. 771\u2013782."},{"key":"19_CR14","volume-title":"Discrete Location Theory","author":"P. B. Mirchandani","year":"1990","unstructured":"P. B. Mirchandani and R. L. Francis, Discrete Location Theory, Wiley-Interscience, New York, NY, 1990."},{"key":"19_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, Inc., New York, NY, 1985."},{"key":"19_CR16","first-page":"355","volume":"519","author":"S. S. Ravi","year":"1991","unstructured":"S. S. Ravi, D. J. Rosenkrantz and G. K. Tayi, \u201cHeuristic and Special Case Algorithms for Dispersion Problems,\u201d 2nd WADS '91 LNCS Vol 519, Aug. 1991, pp 355\u2013366.","journal-title":"2nd WADS '91 LNCS"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57529-4_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:50:04Z","timestamp":1578509404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57529-4_57"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575290","9783540482116"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-57529-4_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}