{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:37:17Z","timestamp":1720201037074},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T00:00:00Z","timestamp":1540252800000},"content-version":"vor","delay-in-days":1483,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["FE407\/17-1"],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1016\/j.tcs.2014.02.050","type":"journal-article","created":{"date-parts":[[2014,3,8]],"date-time":"2014-03-08T22:32:07Z","timestamp":1394317927000},"page":"43-54","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A competitive strategy for distance-aware online shape allocation"],"prefix":"10.1016","volume":"555","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-9062-4241","authenticated-orcid":false,"given":"S\u00e1ndor P.","family":"Fekete","sequence":"first","affiliation":[]},{"given":"Jan-Marc","family":"Reinhardt","sequence":"additional","affiliation":[]},{"given":"Nils","family":"Schweer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.tcs.2014.02.050_br0010","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"},{"issue":"2","key":"10.1016\/j.tcs.2014.02.050_br0020","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.tcs.2014.02.050_br0030","series-title":"14th International Symposium on Algorithms and Computation (ISAAC)","first-page":"385","article-title":"On the locality properties of space-filling curves","author":"Dai","year":"2003"},{"key":"10.1016\/j.tcs.2014.02.050_br0040","series-title":"22nd International Symposium on Algorithms and Computation (ISAAC)","first-page":"260","article-title":"Treemaps with bounded aspect ratio","author":"de Berg","year":"2011"},{"key":"10.1016\/j.tcs.2014.02.050_br0050","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.comgeo.2010.09.004","article-title":"Integer point sets minimizing average pairwise L1 distance: what is the optimal shape of a town?","volume":"40","author":"Demaine","year":"2011","journal-title":"Comput. Geom."},{"key":"10.1016\/j.tcs.2014.02.050_br0060","series-title":"7th International Workshop on Algorithms and Computation (WALCOM)","first-page":"41","article-title":"A competitive strategy for distance-aware online shape allocation","author":"Fekete","year":"2013"},{"issue":"5","key":"10.1016\/j.tcs.2014.02.050_br0070","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1109\/83.499920","article-title":"On the metric properties of discrete space-filling curves","volume":"5","author":"Gotsman","year":"1996","journal-title":"IEEE Trans. Image Process."},{"issue":"3","key":"10.1016\/j.tcs.2014.02.050_br0080","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."},{"issue":"2","key":"10.1016\/j.tcs.2014.02.050_br0090","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."},{"issue":"3","key":"10.1016\/j.tcs.2014.02.050_br0100","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0743-7315(90)90019-L","article-title":"Packing squares into a square","volume":"10","author":"Leung","year":"1990","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.tcs.2014.02.050_br0110","series-title":"Proc. IEEE CLUSTER'02","first-page":"296","article-title":"Processor allocation on Cplant: achieving general processor locality using one-dimensional allocation strategies","author":"Leung","year":"2002"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2014.02.050_br0120","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0166-218X(00)00326-7","article-title":"Towards optimal locality in mesh-indexings","volume":"117","author":"Niedermeier","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2014.02.050_br0130","series-title":"Space-Filling Curves","author":"Sagan","year":"1994"},{"key":"10.1016\/j.tcs.2014.02.050_br0140","series-title":"Algorithms for packing problems","author":"Schweer","year":"2010"},{"key":"10.1016\/j.tcs.2014.02.050_br0150","series-title":"Graph Grammars and Their Application to Computer Science","first-page":"380","article-title":"Space-filling curves and infinite graphs","volume":"vol. 153","author":"Siromoney","year":"1983"},{"key":"10.1016\/j.tcs.2014.02.050_br0160","series-title":"Proceedings of the IEEE Symposium on Information Visualization (INFOVIS)","first-page":"181","article-title":"A note on space-filling visualizations and space-filling curves","author":"Wattenberg","year":"2005"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397514001881?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397514001881?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,22]],"date-time":"2018-10-22T22:08:15Z","timestamp":1540246095000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397514001881"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":16,"alternative-id":["S0304397514001881"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2014.02.050","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2014,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A competitive strategy for distance-aware online shape allocation","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2014.02.050","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}