{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T10:43:14Z","timestamp":1749724994151},"reference-count":8,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1016\/s0167-6377(98)00033-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:03:44Z","timestamp":1027627424000},"page":"41-43","source":"Crossref","is-referenced-by-count":7,"title":["A comment on a minmax location problem"],"prefix":"10.1016","volume":"23","author":[{"given":"Gerhard J.","family":"Woeginger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(98)00033-9_BIB1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, Lower bounds for algebraic computation trees, Proc. 15th Annual Symp. on the Theory of Computing, 1983, pp. 80\u201386.","DOI":"10.1145\/800061.808735"},{"key":"10.1016\/S0167-6377(98)00033-9_BIB2","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, Berlin, 1987.","DOI":"10.1007\/978-3-642-61568-9"},{"key":"10.1016\/S0167-6377(98)00033-9_BIB3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0167-6377(97)00003-5","article-title":"A note on center problems with forbidden polyhedra","volume":"20","author":"Hamacher","year":"1997","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-6377(98)00033-9_BIB4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01840442","article-title":"Geometric complexity and some location problems","volume":"1","author":"Lee","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/S0167-6377(98)00033-9_BIB5","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","article-title":"Linear-time algorithms for linear programming inR3 and related problems","volume":"12","author":"Megiddo","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(98)00033-9_BIB6","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0020-0190(88)90154-8","article-title":"A variant of Ben-Or\u2019s lower bound for algebraic decision trees","volume":"26","author":"Seiferas","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0167-6377(98)00033-9_BIB7","doi-asserted-by":"crossref","unstructured":"M.I. Shamos, D. Hoey, Closest-point problems, Proc. 16th IEEE Symp. on Foundations of Computer Science, 1975, pp. 151\u2013162.","DOI":"10.1109\/SFCS.1975.8"},{"key":"10.1016\/S0167-6377(98)00033-9_BIB8","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1137\/0220041","article-title":"Lower bounds for algebraic computation trees with integer inputs","volume":"20","author":"Yao","year":"1991","journal-title":"SIAM J. Comput."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000339?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000339?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T05:55:54Z","timestamp":1555480554000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637798000339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":8,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0167637798000339"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(98)00033-9","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}