{"id":"https://openalex.org/W2085216434","doi":"https://doi.org/10.1016/s0304-3975(00)00144-4","title":"The ultimate strategy to search on m rays?","display_name":"The ultimate strategy to search on m rays?","publication_year":2001,"publication_date":"2001-06-01","ids":{"openalex":"https://openalex.org/W2085216434","doi":"https://doi.org/10.1016/s0304-3975(00)00144-4","mag":"2085216434"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(00)00144-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(00)00144-4","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5089947217","display_name":"Alejandro L\u00f3pez-Ort\u00edz","orcid":"https://orcid.org/0000-0003-2671-6173"},"institutions":[{"id":"https://openalex.org/I106938459","display_name":"University of New Brunswick","ror":"https://ror.org/05nkf0n29","country_code":"CA","type":"education","lineage":["https://openalex.org/I106938459"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Alejandro L\u00f3pez-Ortiz","raw_affiliation_strings":["Faculty of Computer Science, University of New Brunswick, Fredericton, New Brunswick Canada, E3B 4A1","Univ. of New Brunswick, New Brunswick, Canada#TAB#"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, University of New Brunswick, Fredericton, New Brunswick Canada, E3B 4A1","institution_ids":["https://openalex.org/I106938459"]},{"raw_affiliation_string":"Univ. of New Brunswick, New Brunswick, Canada#TAB#","institution_ids":["https://openalex.org/I106938459"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058227744","display_name":"Sven Schuierer","orcid":"https://orcid.org/0000-0003-1659-0941"},"institutions":[{"id":"https://openalex.org/I4210126395","display_name":"Inform (Germany)","ror":"https://ror.org/02x8c2t37","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210126395"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Sven Schuierer","raw_affiliation_strings":["Institut f\u00fcr Informatik, Am Flughafen 17, Geb. 051, D-79110 Freiburg, Germany","Institut f\u00fcr Informatik, Frieburg, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Am Flughafen 17, Geb. 051, D-79110 Freiburg, Germany","institution_ids":[]},{"raw_affiliation_string":"Institut f\u00fcr Informatik, Frieburg, Germany#TAB#","institution_ids":["https://openalex.org/I4210126395"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058227744"],"corresponding_institution_ids":["https://openalex.org/I4210126395"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":1.3404,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.86630623,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"261","issue":"2","first_page":"267","last_page":"295"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9811000227928162,"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.8628553152084351},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7617940306663513},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5640959143638611},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5293541550636292},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36199402809143066},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35535556077957153},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07952159643173218}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8628553152084351},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7617940306663513},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5640959143638611},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5293541550636292},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36199402809143066},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35535556077957153},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07952159643173218}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0304-3975(00)00144-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(00)00144-4","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1507457224","https://openalex.org/W1558229539","https://openalex.org/W1967507886","https://openalex.org/W1975581626","https://openalex.org/W1979503961","https://openalex.org/W1992876208","https://openalex.org/W2002890219","https://openalex.org/W2019729116","https://openalex.org/W2027345534","https://openalex.org/W2041645394","https://openalex.org/W2217504651","https://openalex.org/W4285241170"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W1488585910","https://openalex.org/W2563401265","https://openalex.org/W2012502482","https://openalex.org/W2007980826","https://openalex.org/W1969305723","https://openalex.org/W2950803469","https://openalex.org/W4390751688","https://openalex.org/W1967209836","https://openalex.org/W2165839536"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
