{"id":"https://openalex.org/W1965155276","doi":"https://doi.org/10.1137/060662204","title":"Competitive Online Approximation of the Optimal Search Ratio","display_name":"Competitive Online Approximation of the Optimal Search Ratio","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1965155276","doi":"https://doi.org/10.1137/060662204","mag":"1965155276"},"language":"en","primary_location":{"id":"doi:10.1137/060662204","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060662204","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112284215","display_name":"Rudolf Fleischer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rudolf Fleischer","raw_affiliation_strings":["[email\u00a0protected]#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[email\u00a0protected]#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090507731","display_name":"Tom Kamphans","orcid":"https://orcid.org/0000-0003-4848-7885"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tom Kamphans","raw_affiliation_strings":["[email\u00a0protected]#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[email\u00a0protected]#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109226564","display_name":"Rolf Klein","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rolf Klein","raw_affiliation_strings":["[email\u00a0protected] and [email\u00a0protected]#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[email\u00a0protected] and [email\u00a0protected]#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058265992","display_name":"Elmar Langetepe","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Elmar Langetepe","raw_affiliation_strings":["Institute of Computer Science I, University of Bonn, Bonn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science I, University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039893034","display_name":"Gerhard Trippen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gerhard Trippen","raw_affiliation_strings":["[email\u00a0protected]#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[email\u00a0protected]#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2615,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.88690295,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"38","issue":"3","first_page":"881","last_page":"898"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9850000143051147,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.8122991323471069},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6472945213317871},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6061155796051025},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5611239075660706},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.5118095278739929},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4902237057685852},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4686562120914459},{"id":"https://openalex.org/keywords/search-problem","display_name":"Search problem","score":0.4530163109302521},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.43739116191864014},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39427658915519714},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.39210107922554016},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38715845346450806},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3465818762779236},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3252352476119995},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3230511248111725},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.15230226516723633}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8122991323471069},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6472945213317871},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6061155796051025},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5611239075660706},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.5118095278739929},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4902237057685852},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4686562120914459},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.4530163109302521},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.43739116191864014},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39427658915519714},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.39210107922554016},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38715845346450806},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3465818762779236},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3252352476119995},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3230511248111725},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.15230226516723633},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/060662204","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060662204","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1480871931","https://openalex.org/W1489894904","https://openalex.org/W1490549084","https://openalex.org/W1492865622","https://openalex.org/W1501351249","https://openalex.org/W1501957312","https://openalex.org/W1531274257","https://openalex.org/W1563776668","https://openalex.org/W1972868674","https://openalex.org/W1994248285","https://openalex.org/W2019729116","https://openalex.org/W2023469771","https://openalex.org/W2050037634","https://openalex.org/W2064284095","https://openalex.org/W2075002099","https://openalex.org/W2077944048","https://openalex.org/W2092395565","https://openalex.org/W2123945156","https://openalex.org/W2125334953","https://openalex.org/W2142607374","https://openalex.org/W2145459554","https://openalex.org/W2149735608","https://openalex.org/W2158277215","https://openalex.org/W2158652185","https://openalex.org/W2165142526","https://openalex.org/W2175742361","https://openalex.org/W2920234783","https://openalex.org/W4256624975","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2564742953","https://openalex.org/W4213299358","https://openalex.org/W3115340459","https://openalex.org/W1580966357","https://openalex.org/W2092227404","https://openalex.org/W2063410603","https://openalex.org/W3094338351","https://openalex.org/W2147746266","https://openalex.org/W2952044966","https://openalex.org/W1965155276"],"abstract_inverted_index":{"How":[0,15],"efficiently":[1],"can":[2],"we":[3,59],"search":[4,39,49],"an":[5,12],"unknown":[6,13],"environment":[7,22],"for":[8,29,33],"a":[9,53,69],"goal":[10],"in":[11],"position?":[14],"much":[16],"would":[17],"it":[18],"help":[19],"if":[20],"the":[21,46],"were":[23],"known?":[24],"We":[25,67],"answer":[26],"these":[27],"questions":[28],"simple":[30],"polygons":[31],"and":[32,76],"undirected":[34],"graphs":[35],"by":[36],"providing":[37],"online":[38,64],"strategies":[40],"that":[41,61],"are":[42],"as":[43,45],"good":[44],"best":[47],"offline":[48],"algorithms,":[50],"up":[51],"to":[52],"constant":[54],"factor.":[55],"For":[56],"other":[57],"settings":[58],"prove":[60],"no":[62],"such":[63],"algorithms":[65],"exist.":[66],"introduce":[68],"natural":[70],"measure":[71],"which":[72],"gives":[73],"reasonable":[74],"results":[75],"is":[77],"more":[78],"realistic":[79],"than":[80],"pure":[81],"pessimistic":[82],"competitive":[83],"analysis.":[84]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}