{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:04:48Z","timestamp":1763467488962},"reference-count":35,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5860,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,7]]},"DOI":"10.1016\/s0304-3975(96)00304-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"379-404","source":"Crossref","is-referenced-by-count":19,"title":["Compact location problems"],"prefix":"10.1016","volume":"181","author":[{"given":"S.O.","family":"Krumke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.V.","family":"Marathe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Noltemeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Radhakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.S.","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.J.","family":"Rosenkrantz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00304-0_BIB1","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/0196-6774(91)90022-Q","article-title":"Finding k points with minimum diameter and related problems","volume":"12","author":"Aggarwal","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB2","series-title":"Network Flows: Theory, Algorithms and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB3","series-title":"Introduction to Mathematical Techniques in Pattern Recognition","author":"Andrews","year":"1972"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB4","series-title":"Proc. 27th Ann. ACM Symp. on the Theory of Computing (STOC '95)","first-page":"277","article-title":"Improved approximation guarantees for minimum weight k-trees and prize-collecting salesmen","author":"Awerbuch","year":"1995"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB5","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1006\/jagm.1993.1047","article-title":"How to allocate network centers","volume":"15","author":"Bar-Ilan","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB6","series-title":"Proc. 26th Ann. ACM Symp. on the Theory of Computing (STOC '94)","first-page":"184","article-title":"Improved nonapproximability results","author":"Bellare","year":"1994"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB7","series-title":"Approximation algorithms for geometric problems","author":"Bern","year":"1995"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB8","series-title":"Proc. 27th Ann. ACM Symp. on the Theory of Computing (STOC '95)","first-page":"294","article-title":"constant-factor approximation for the k-MST problem in the plane","author":"Blum","year":"1995"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB9","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB10","series-title":"Algorithms and Data Structures, Third Workshop","first-page":"265","article-title":"Static and dynamic algorithms for k-point clustering problems","volume":"Vol. 709","author":"Datta","year":"1993"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB11","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0167-6377(85)90002-1","article-title":"A simple heuristic for the p-center problem","volume":"3","author":"Dyer","year":"1985","journal-title":"Oper. Res. Lett."},{"issue":"11","key":"10.1016\/S0304-3975(96)00304-0_BIB12","first-page":"321","article-title":"Iterated nearest neighbors and finding minimal polytopes","author":"Erickson","year":"1994","journal-title":"Discrete Comput. Geometry"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB13","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0377-2217(89)90420-7","article-title":"Analytical models for locating undesirable facilities","volume":"40","author":"Erkut","year":"1989","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0304-3975(96)00304-0_BIB14","series-title":"ACM Symp. on Theory of Computing (STOC '88)","first-page":"434","article-title":"Optimal algorithms for approximate clustering","author":"Feder","year":"1988"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB15","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB16","series-title":"Proc. 26th ACM Symp. on Theory of Computing (STOC '94)","first-page":"432","article-title":"An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane","author":"Garg","year":"1994"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB17","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","article-title":"Clustering to minimize the maximum intercluster distance","volume":"38","author":"Gonzalez","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00304-0_BIB18","series-title":"Location on Networks: Theory and Algorithm","author":"Handler","year":"1979"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB19","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/5925.5933","article-title":"A unified approach to approximation algorithms for bottleneck problems","volume":"33","author":"Hochbaum","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB20","series-title":"Proc. 34th Ann. IEEE Symp. on the Foundations of Computer Science (FOCS '93)","first-page":"692","article-title":"On choosing a dense subgraph","author":"Kortsarz","year":"1993"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB21","article-title":"Compact location problems","author":"Krumke","year":"1996","journal-title":"Tech. Report LA-UR 96-0210"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB22","series-title":"Proc. 1st Internat. Conf. on Computing and Combinatorics","first-page":"510","article-title":"Compact location problems with budget and communication constraints","volume":"Vol. 959","author":"Krumke","year":"1995"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB23","series-title":"21st Workshop in Graph Theoretic Concepts in Computer Science (WG '95)","article-title":"Bicriteria problems in location theory","author":"Krumke","year":"1995"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB24","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1109\/TC.1982.1676031","article-title":"On k-nearest neighbor Voronoi diagrams in the plane","volume":"C-31","author":"Lee","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(96)00304-0_BIB25","series-title":"ACM Symp. on Theory of Computing (STOC '92)","first-page":"771","article-title":"\u03b5-approximations with minimum packing constraint violation","author":"Lin","year":"1992"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB26","series-title":"Proc. 22nd Internat. Coll. on Automata Languages and Programming (ICALP'95)","first-page":"487","article-title":"Bicriteria network design problems","volume":"Vol. 944","author":"Marathe","year":"1995"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB27","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","article-title":"Applying parallel computation algorithms in the design of serial algorithms","volume":"30","author":"Megiddo","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB28","series-title":"Discrete Location Theory","author":"Mirchandani","year":"1990"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB29","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB30","series-title":"Proc. 13th Conf. on the Foundations of Software Technology and Theoretical Computer Science (FST&TCS '93)","first-page":"238","article-title":"Compact location problems","volume":"Vol. 761","author":"Radhakrishnan","year":"1993"},{"key":"10.1016\/S0304-3975(96)00304-0_BIB31","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1287\/opre.42.2.299","article-title":"Heuristic and special case algorithms for dispersion problems","volume":"42","author":"Ravi","year":"1994","journal-title":"Oper. Res."},{"key":"10.1016\/S0304-3975(96)00304-0_BIB32","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/S0895480194266331","article-title":"Spanning trees short or small","volume":"9","author":"Ravi","year":"1996","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(96)00304-0_BIB33","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/0206041","article-title":"An analysis of several heuristics for the traveling salesman problem","volume":"6","author":"Rosenkrantz","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00304-0_BIB34","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1137\/0404048","article-title":"Obnoxious facility location on graphs","volume":"4","author":"Tamir","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(96)00304-0_BIB35","first-page":"25","article-title":"Minimal and bounded trees","author":"Zelikowsky","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596003040?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596003040?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:58:36Z","timestamp":1555419516000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596003040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["S0304397596003040"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00304-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}