{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T14:10:30Z","timestamp":1660313430851},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2011,2,1]],"date-time":"2011-02-01T00:00:00Z","timestamp":1296518400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,2,1]],"date-time":"2015-02-01T00:00:00Z","timestamp":1422748800000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1016\/j.comgeo.2010.09.004","type":"journal-article","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T09:53:19Z","timestamp":1285667599000},"page":"82-94","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"title":["Integer point sets minimizing average pairwise L<\/mml:mi>1<\/mml:mn><\/mml:msub><\/mml:math> distance: What is the optimal shape of a town?"],"prefix":"10.1016","volume":"44","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[]},{"given":"S\u00e1ndor P.","family":"Fekete","sequence":"additional","affiliation":[]},{"given":"G\u00fcnter","family":"Rote","sequence":"additional","affiliation":[]},{"given":"Nils","family":"Schweer","sequence":"additional","affiliation":[]},{"given":"Daria","family":"Schymura","sequence":"additional","affiliation":[]},{"given":"Mariano","family":"Zelke","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.comgeo.2010.09.004_br0010","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1006\/jcss.1998.1605","article-title":"Polynomial time approximation schemes for dense instances of NP-hard problems","volume":"58","author":"Arora","year":"1999","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"10.1016\/j.comgeo.2010.09.004_br0020","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1006\/jagm.1999.1062","article-title":"Greedily finding a dense subgraph","volume":"34","author":"Asahiro","year":"2000","journal-title":"J. Algorithms"},{"key":"10.1016\/j.comgeo.2010.09.004_br0030","doi-asserted-by":"crossref","unstructured":"Y. Bartal, M. Charikar, D. Raz, Approximating min-sum k-clustering in metric spaces, in: Proc. 33rd Symposium on Theory of Computing, 2001, pp. 11\u201320.","DOI":"10.1145\/380752.380754"},{"key":"10.1016\/j.comgeo.2010.09.004_br0040","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1088\/0305-4470\/37\/1\/010","article-title":"What is the optimal shape of a city?","volume":"37","author":"Bender","year":"2004","journal-title":"J. Phys. A: Math. Gen."},{"issue":"2","key":"10.1016\/j.comgeo.2010.09.004_br0050","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s00453-007-9037-2","article-title":"Communication-aware processor allocation for supercomputers: Finding point sets of small average distance","volume":"50","author":"Bender","year":"2008","journal-title":"Algorithmica"},{"key":"10.1016\/j.comgeo.2010.09.004_br0060","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s00453-003-1074-x","article-title":"Maximum dispersion and geometric maximum weight cliques","volume":"38","author":"Fekete","year":"2003","journal-title":"Algorithmica"},{"key":"10.1016\/j.comgeo.2010.09.004_br0070","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/opre.1040.0137","article-title":"On the continuous Fermat\u2013Weber problems","volume":"53","author":"Fekete","year":"2005","journal-title":"Oper. Res."},{"key":"10.1016\/j.comgeo.2010.09.004_br0080","doi-asserted-by":"crossref","unstructured":"S.P. Fekete, J.S.B. Mitchell, K. Weinbrecht, On the continuous Weber and k-median problems, in: Proc. 16th Annual Symposium on Computational Geometry (SoCG), 2000, pp. 70\u201379.","DOI":"10.1145\/336154.336182"},{"key":"10.1016\/j.comgeo.2010.09.004_br0090","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0166-218X(98)00100-0","article-title":"Approximation algorithms for minimum sum p-clustering","volume":"89","author":"Guttmann-Beck","year":"1998","journal-title":"Disc. Appl. Math."},{"issue":"1","key":"10.1016\/j.comgeo.2010.09.004_br0100","doi-asserted-by":"crossref","first-page":"18:1","DOI":"10.1145\/1644015.1644033","article-title":"Approximating the minimum quadratic assignment problems","volume":"6","author":"Hassin","year":"2009","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"10.1016\/j.comgeo.2010.09.004_br0110","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0167-6377(97)00034-5","article-title":"Approximation algorithms for maximum dispersion","volume":"21","author":"Hassin","year":"1997","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.comgeo.2010.09.004_br0120","unstructured":"P. Indyk, A sublinear time approximation scheme for clustering in metric spaces, in: Proc. 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 1999, pp. 154\u2013159."},{"issue":"3","key":"10.1016\/j.comgeo.2010.09.004_br0130","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1137\/0204023","article-title":"Near-optimal solutions to a 2-dimensional placement problem","volume":"4","author":"Karp","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.comgeo.2010.09.004_br0140","series-title":"Proc. 34th Annual Symposium on Foundations of Computer Science","first-page":"692","article-title":"On choosing a dense subgraph","author":"Kortsarz","year":"1993"},{"issue":"2","key":"10.1016\/j.comgeo.2010.09.004_br0150","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0304-3975(96)00304-0","article-title":"Compact location problems","volume":"181","author":"Krumke","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.comgeo.2010.09.004_br0160","doi-asserted-by":"crossref","unstructured":"V. Leung, E. Arkin, M. Bender, D. Bunde, J. Johnston, A. Lal, J. Mitchell, C. Phillips, S. Seiden, Processor allocation on Cplant: Achieving general processor locality using one-dimensional allocation strategies. in: Proc. 4th IEEE International Conference on Cluster Computing, 2002, pp. 296\u2013304.","DOI":"10.2172\/800975"},{"issue":"2","key":"10.1016\/j.comgeo.2010.09.004_br0170","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","article-title":"A survey for the quadratic assignment problem","volume":"176","author":"Loiola","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.comgeo.2010.09.004_br0180","unstructured":"J. Mache, V. Lo, Dispersal metrics for non-contiguous processor allocation, Technical Report CIS-TR-96-13, University of Oregon, 1996."},{"key":"10.1016\/j.comgeo.2010.09.004_br0190","unstructured":"J. Mache, V. Lo, The effects of dispersal on message-passing contention in processor allocation strategies, in: Proc. Third Joint Conference on Information Sciences, Sessions on Parallel and Distributed Processing, vol. 3, 1997, pp. 223\u2013226."},{"issue":"2","key":"10.1016\/j.comgeo.2010.09.004_br0200","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."},{"issue":"3","key":"10.1016\/j.comgeo.2010.09.004_br0210","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","article-title":"P-complete approximation problems","volume":"23","author":"Sahni","year":"1976","journal-title":"J. ACM"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772110000726?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772110000726?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T13:33:11Z","timestamp":1660311191000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772110000726"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["S0925772110000726"],"URL":"https:\/\/doi.org\/10.1016\/j.comgeo.2010.09.004","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[2011,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Integer point sets minimizing average pairwise distance: What is the optimal shape of a town?","name":"articletitle","label":"Article Title"},{"value":"Computational Geometry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.comgeo.2010.09.004","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2010 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}