{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T04:16:55Z","timestamp":1740111415471,"version":"3.37.3"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T00:00:00Z","timestamp":1726358400000},"content-version":"vor","delay-in-days":1475,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"name":"DST-INSPIRE Faculty grant","award":["DST-IFA-14-ENG-75"]},{"DOI":"10.13039\/501100007488","name":"IIT Delhi","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007488","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1016\/j.dam.2020.01.040","type":"journal-article","created":{"date-parts":[[2020,2,15]],"date-time":"2020-02-15T07:28:47Z","timestamp":1581751727000},"page":"456-472","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Constant work-space algorithms for facility location problems"],"prefix":"10.1016","volume":"283","author":[{"given":"Binay K.","family":"Bhattacharya","sequence":"first","affiliation":[]},{"given":"Minati","family":"De","sequence":"additional","affiliation":[]},{"given":"Subhas C.","family":"Nandy","sequence":"additional","affiliation":[]},{"given":"Sasanka","family":"Roy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.dam.2020.01.040_b1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s00453-013-9846-4","article-title":"Streaming algorithms for extent problems in high dimensions","volume":"72","author":"Agarwal","year":"2015","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/j.dam.2020.01.040_b2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.ic.2003.09.002","article-title":"The complexity of planarity testing","volume":"189","author":"Allender","year":"2004","journal-title":"Inform. and Comput."},{"year":"2009","series-title":"Computational Complexity - A Modern Approach","author":"Arora","key":"10.1016\/j.dam.2020.01.040_b3"},{"issue":"1","key":"10.1016\/j.dam.2020.01.040_b4","first-page":"46","article-title":"Constant-work-space algorithms for geometric problems","volume":"2","author":"Asano","year":"2011","journal-title":"JoCG"},{"issue":"5","key":"10.1016\/j.dam.2020.01.040_b5","doi-asserted-by":"crossref","first-page":"569","DOI":"10.7155\/jgaa.00240","article-title":"Constant-work-space algorithms for shortest paths in trees and simple polygons","volume":"15","author":"Asano","year":"2011","journal-title":"J. Graph Algorithms Appl."},{"key":"10.1016\/j.dam.2020.01.040_b6","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0966-8349(98)00033-3","article-title":"Minmax regret p-center location on a network with demand uncertainty","volume":"5","author":"Averbakh","year":"1997","journal-title":"Locat. Sci."},{"issue":"2","key":"10.1016\/j.dam.2020.01.040_b7","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/S0377-2217(99)00257-X","article-title":"Algorithms for the robust 1-center problem on a tree","volume":"123","author":"Averbakh","year":"2000","journal-title":"European J. Oper. Res."},{"year":"2018","series-title":"Geometric algorithms with limited workspace","author":"Banyassady","key":"10.1016\/j.dam.2020.01.040_b8"},{"key":"10.1016\/j.dam.2020.01.040_b9","doi-asserted-by":"crossref","unstructured":"B. Ben-Moshe, B.K. Bhattacharya, Q. Shi, An optimal algorithm for the continuous\/discrete weighted 2-center problem in trees, in: LATIN 2006, pp. 166\u2013177.","DOI":"10.1007\/11682462_19"},{"year":"2014","series-title":"Facility location problems in the constant work-space read-only memory model","author":"Bhattacharya","key":"10.1016\/j.dam.2020.01.040_b10"},{"key":"10.1016\/j.dam.2020.01.040_b11","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.dam.2014.10.022","article-title":"Minmax regret 1-center algorithms for path\/tree\/unicycle\/cactus networks","volume":"195","author":"Bhattacharya","year":"2015","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2020.01.040_b12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.tcs.2015.11.048","article-title":"Space-efficient algorithm for computing a centerpoint of a set of points in R2","volume":"615","author":"Bhattacharya","year":"2016","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/j.dam.2020.01.040_b13","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0022-0000(81)90037-4","article-title":"A time-space tradeoff for sorting on non-oblivious machines","volume":"22","author":"Borodin","year":"1981","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/j.dam.2020.01.040_b14","doi-asserted-by":"crossref","DOI":"10.1145\/1721837.1721842","article-title":"Comparison-based time-space lower bounds for selection","volume":"6","author":"Chan","year":"2010","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"10.1016\/j.dam.2020.01.040_b15","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s00454-006-1275-6","article-title":"Multi-pass geometric algorithms","volume":"37","author":"Chan","year":"2007","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"10.1016\/j.dam.2020.01.040_b16","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/j.comgeo.2013.05.007","article-title":"Streaming and dynamic algorithms for minimum enclosing balls in high dimensions","volume":"47","author":"Chan","year":"2014","journal-title":"Comput. Geom."},{"issue":"1","key":"10.1016\/j.dam.2020.01.040_b17","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/7531.7537","article-title":"Slowing down sorting networks to obtain faster sorting algorithms","volume":"34","author":"Cole","year":"1987","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.dam.2020.01.040_b18","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1016\/j.jcss.2014.08.001","article-title":"Prune-and-search with limited workspace","volume":"81","author":"De","year":"2015","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.dam.2020.01.040_b19","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.tcs.2014.06.012","article-title":"Selection from read-only memory with limited workspace","volume":"554","author":"Elmasry","year":"2014","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.dam.2020.01.040_b20","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0022-0000(87)90002-X","article-title":"Upper bounds for time-space trade-offs in sorting and selection","volume":"34","author":"Frederickson","year":"1987","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/j.dam.2020.01.040_b21","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/opre.13.3.462","article-title":"Optimum distribution of switching centers in a communication network and some related graph theoretic problems","volume":"13","author":"Hakimi","year":"1965","journal-title":"Oper. Res."},{"issue":"1\u20134","key":"10.1016\/j.dam.2020.01.040_b22","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1023\/A:1026110926707","article-title":"Location science research: A review","volume":"123","author":"Hale","year":"2003","journal-title":"Ann. OR"},{"issue":"2","key":"10.1016\/j.dam.2020.01.040_b23","first-page":"19","article-title":"Shortest path in a polygon using sublinear space","volume":"7","author":"Har-Peled","year":"2016","journal-title":"JoCG"},{"year":"1972","series-title":"Graph Theory","author":"Harary","key":"10.1016\/j.dam.2020.01.040_b24"},{"key":"10.1016\/j.dam.2020.01.040_b25","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","article-title":"Selection and sorting with limited storage","volume":"12","author":"Ian\u00a0Munro","year":"1980","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/j.dam.2020.01.040_b26","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","article-title":"An algorithmic approach to network location problems. i: The p-centers","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"10.1016\/j.dam.2020.01.040_b27","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","article-title":"An algorithmic approach to network location problems. ii: The p-medians","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM J. Appl. Math."},{"year":"1997","series-title":"Robust Discrete Optimization and Its Applications","author":"Kouvelis","key":"10.1016\/j.dam.2020.01.040_b28"},{"issue":"4","key":"10.1016\/j.dam.2020.01.040_b29","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","article-title":"Linear-time algorithms for linear programming in R3 and related problems","volume":"12","author":"Megiddo","year":"1983","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.dam.2020.01.040_b30","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(95)00225-1","article-title":"Selection from read-only memory and sorting with minimum data movement","volume":"165","author":"Munro","year":"1996","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/j.dam.2020.01.040_b31","first-page":"162","article-title":"Improved upper bounds for time-space trade-offs for selection","volume":"6","author":"Raman","year":"1999","journal-title":"Nord. J. Comput."},{"issue":"4","key":"10.1016\/j.dam.2020.01.040_b32","doi-asserted-by":"crossref","DOI":"10.1145\/1391289.1391291","article-title":"Undirected connectivity in log-space","volume":"55","author":"Reingold","year":"2008","journal-title":"J. ACM"},{"year":"2008","series-title":"Efficient Algorithms for Network Center\/Covering Location Optimization Problems","author":"Shi","key":"10.1016\/j.dam.2020.01.040_b33"},{"key":"10.1016\/j.dam.2020.01.040_b34","first-page":"79","article-title":"A question in the geometry of situation","volume":"1","author":"Sylvester","year":"1857","journal-title":"Q. J. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X20300573?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X20300573?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T06:03:54Z","timestamp":1726380234000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X20300573"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":34,"alternative-id":["S0166218X20300573"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2020.01.040","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2020,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Constant work-space algorithms for facility location problems","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2020.01.040","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}