{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:50:43Z","timestamp":1648939843854},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,4,23]],"date-time":"2011-04-23T00:00:00Z","timestamp":1303516800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Sci Res Dev"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s00450-011-0151-7","type":"journal-article","created":{"date-parts":[[2011,4,22]],"date-time":"2011-04-22T06:40:24Z","timestamp":1303454424000},"page":"207-216","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing two-sequence functionals in competitive analysis"],"prefix":"10.1007","volume":"27","author":[{"given":"Elmar","family":"Langetepe","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,23]]},"reference":[{"key":"151_CR1","volume-title":"The theory of search games and rendezvous","author":"S Alpern","year":"2003","unstructured":"Alpern S, Gal S (2003) The theory of search games and rendezvous. Kluwer Academic, Norwell"},{"key":"151_CR2","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R Baeza-Yates","year":"1993","unstructured":"Baeza-Yates R, Culberson J, Rawlins G (1993) Searching in the plane. Inf Comput 106:234\u2013252","journal-title":"Inf Comput"},{"key":"151_CR3","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/BF02798690","volume":"8","author":"A Beck","year":"1970","unstructured":"Beck A, Newman DJ (1970) Yet more on the linear search problem. Isr J Math 8:419\u2013429","journal-title":"Isr J Math"},{"issue":"2","key":"151_CR4","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02762672","volume":"14","author":"A Beck","year":"1973","unstructured":"Beck A, Warren P (1973) The return of the linear search problem. Isr J Math 14(2):169\u2013183","journal-title":"Isr J Math"},{"key":"151_CR5","doi-asserted-by":"crossref","unstructured":"Bellman R (1963) An optimal search problem. SIAM Rev 274(5)","DOI":"10.1137\/1005070"},{"key":"151_CR6","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge"},{"key":"151_CR7","series-title":"Lecture notes comput sci","volume-title":"On-line algorithms: the state of the art","year":"1998","unstructured":"Fiat A, Woeginger G (eds) (1998) On-line algorithms: the state of the art. Lecture notes comput sci, vol 1442. Springer, Berlin"},{"key":"151_CR8","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1137\/0127002","volume":"27","author":"S Gal","year":"1974","unstructured":"Gal S (1974) Minimax solutions for linear search problems. SIAM J Appl Math 27:17\u201330","journal-title":"SIAM J Appl Math"},{"key":"151_CR9","series-title":"Mathematics in science and engineering","volume-title":"Search games","author":"S Gal","year":"1980","unstructured":"Gal S (1980) Search games. Mathematics in science and engineering, vol 149. Academic Press, New York"},{"key":"151_CR10","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1137\/0130032","volume":"30","author":"S Gal","year":"1976","unstructured":"Gal S, Chazan D (1976) On the optimality of the exponential functions for some minimax problems. SIAM J Appl Math 30:324\u2013348","journal-title":"SIAM J Appl Math"},{"key":"151_CR11","volume-title":"Concrete mathematics","author":"RL Graham","year":"1994","unstructured":"Graham RL, Knuth DE, Patashnik O (1994) Concrete mathematics, 2nd edn. Addison-Wesley, Reading","edition":"2"},{"key":"151_CR12","series-title":"Lecture notes comput sci","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/3-540-49116-3_12","volume-title":"Proc 16th sympos theoret aspects comput sci","author":"M Hammar","year":"1999","unstructured":"Hammar M, Nilsson BJ, Schuierer S (1999) Parallel searching on m rays. In: Proc 16th sympos theoret aspects comput sci. Lecture notes comput sci, vol 1563. Springer, Berlin, pp 132\u2013142"},{"key":"151_CR13","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0166-218X(99)00009-8","volume":"93","author":"C Hipke","year":"1999","unstructured":"Hipke C, Icking C, Klein R, Langetepe E (1999) How to find a point on a line within a fixed distance. Discrete Appl Math 93:67\u201373","journal-title":"Discrete Appl Math"},{"key":"151_CR14","series-title":"Lecture notes comput sci","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/3-540-45993-6_14","volume-title":"Sensor based intelligent robots","author":"C Icking","year":"2002","unstructured":"Icking C, Kamphans T, Klein R, Langetepe E (2002) On the competitive complexity of navigation tasks. In: Bunke H, Christensen HI, Hager GD, Klein R (eds) Sensor based intelligent robots. Lecture notes comput sci, vol 2238. Springer, Berlin, pp 245\u2013258"},{"key":"151_CR15","first-page":"111","volume-title":"Abstracts 21st European workshop comput geom","author":"T Kamphans","year":"2005","unstructured":"Kamphans T, Langetepe E (2005) On optimizing multi-sequence functionals for competitive analysis. In: Abstracts 21st European workshop comput geom, pp 111\u2013114"},{"key":"151_CR16","series-title":"Lecture notes comput sci","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/11427186_51","volume-title":"Proc 4th internat workshop efficient experim algorithms","author":"T Kamphans","year":"2005","unstructured":"Kamphans T, Langetepe E (2005) Optimal competitive online ray search with an error-prone robot. In: Proc 4th internat workshop efficient experim algorithms. Lecture notes comput sci, vol 3503. Springer, Berlin, pp 593\u2013596"},{"key":"151_CR17","first-page":"441","volume-title":"Proc 4th ACM-SIAM sympos discrete algorithms","author":"M-Y Kao","year":"1993","unstructured":"Kao M-Y, Reif JH, Tate SR (1993) Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem. In: Proc 4th ACM-SIAM sympos discrete algorithms, pp 441\u2013447"},{"key":"151_CR18","unstructured":"Langetepe E (2000) Design and analysis of strategies for autonomous systems in motion planning. PhD thesis, Department of Computer Science, FernUniversit\u00e4t Hagen"},{"key":"151_CR19","first-page":"1","volume-title":"SODA 2010: Proc 21st annu ACM-SIAM symp disc algor","author":"E Langetepe","year":"2010","unstructured":"Langetepe E (2010) On the optimality of spiral search. In: SODA 2010: Proc 21st annu ACM-SIAM symp disc algor, pp 1\u201312"},{"key":"151_CR20","unstructured":"L\u00f3pez-Ortiz A (1996) On-line target searching in bounded and unbounded domains. PhD thesis, Univ Waterloo, Waterloo, Canada"},{"issue":"2","key":"151_CR21","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0304-3975(00)00144-4","volume":"261","author":"A L\u00f3pez-Ortiz","year":"2001","unstructured":"L\u00f3pez-Ortiz A, Schuierer S (2001) The ultimate strategy to search on m rays? Theor Comput Sci 261(2):267\u2013295","journal-title":"Theor Comput Sci"},{"key":"151_CR22","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1016\/j.tcs.2003.08.001","volume":"310","author":"A L\u00f3pez-Ortiz","year":"2004","unstructured":"L\u00f3pez-Ortiz A, Schuierer S (2004) Online parallel heuristics, processor scheduling, and robot searching under the competitive framework. Theor Comput Sci 310:527\u2013537","journal-title":"Theor Comput Sci"},{"key":"151_CR23","doi-asserted-by":"crossref","unstructured":"Rao NSV, Kareti S, Shi W, Iyengar SS (1993) Robot navigation in unknown terrains: introductory survey of non-heuristic algorithms. Technical Report ORNL\/TM-12410, Oak Ridge National Laboratory","DOI":"10.2172\/10180101"},{"key":"151_CR24","unstructured":"Schuierer S (1998) Searching on m bounded rays optimally. Technical Report 112, Institut f\u00fcr Informatik, Universit\u00e4t Freiburg, Germany"},{"key":"151_CR25","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0925-7721(00)00030-4","volume":"18","author":"S Schuierer","year":"2001","unstructured":"Schuierer S (2001) Lower bounds in on-line geometric searching. Comput Geom Theory Appl 18:37\u201353","journal-title":"Comput Geom Theory Appl"},{"key":"151_CR26","series-title":"Lecture notes comput sci","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/3-540-36477-3_20","volume-title":"Computer science in perspective: essays dedicated to Thomas Ottoman","author":"S Schuierer","year":"2003","unstructured":"Schuierer S (2003) A lower bound for randomized searching on m rays. In: Klein R, Six HW, Wegner L (eds) Computer science in perspective: essays dedicated to Thomas Ottoman. Lecture notes comput sci, vol 2598. Springer, Berlin, pp 264\u2013277"},{"key":"151_CR27","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator DD, Tarjan RE (1985) Amortized efficiency of list update and paging rules. Commun ACM 28:202\u2013208","journal-title":"Commun ACM"}],"container-title":["Computer Science - Research and Development"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00450-011-0151-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00450-011-0151-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00450-011-0151-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T06:28:00Z","timestamp":1560148080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00450-011-0151-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,23]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["151"],"URL":"https:\/\/doi.org\/10.1007\/s00450-011-0151-7","relation":{},"ISSN":["1865-2034","1865-2042"],"issn-type":[{"value":"1865-2034","type":"print"},{"value":"1865-2042","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,23]]}}}