{"id":"https://openalex.org/W3120251268","doi":"https://doi.org/10.1007/s00453-022-01035-6","title":"Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries","display_name":"Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries","publication_year":2022,"publication_date":"2022-09-15","ids":{"openalex":"https://openalex.org/W3120251268","doi":"https://doi.org/10.1007/s00453-022-01035-6","mag":"3120251268"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-022-01035-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-01035-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01035-6.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01035-6.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049579750","display_name":"Thomas Erlebach","orcid":"https://orcid.org/0000-0002-4470-5868"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Thomas Erlebach","raw_affiliation_strings":["Department of Computer Science, Durham University, Durham, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Durham University, Durham, UK","institution_ids":["https://openalex.org/I190082696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103088991","display_name":"Michael M. Hoffmann","orcid":"https://orcid.org/0000-0001-5307-7106"},"institutions":[{"id":"https://openalex.org/I153648349","display_name":"University of Leicester","ror":"https://ror.org/04h699437","country_code":"GB","type":"education","lineage":["https://openalex.org/I153648349"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Michael Hoffmann","raw_affiliation_strings":["School of Informatics, University of Leicester, Leicester, UK"],"affiliations":[{"raw_affiliation_string":"School of Informatics, University of Leicester, Leicester, UK","institution_ids":["https://openalex.org/I153648349"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020807570","display_name":"Murilo Santos de Lima","orcid":"https://orcid.org/0000-0002-2297-811X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Murilo Santos de Lima","raw_affiliation_strings":["Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Munich, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5049579750"],"corresponding_institution_ids":["https://openalex.org/I190082696"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.2854,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.54666304,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"85","issue":"2","first_page":"406","last_page":"443"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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":0.9994999766349792,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6797173023223877},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.662322461605072},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.538976788520813},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5209671258926392},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5207114815711975},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.5152049660682678},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46932074427604675},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3705947995185852},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.09577757120132446}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6797173023223877},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.662322461605072},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.538976788520813},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5209671258926392},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5207114815711975},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.5152049660682678},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46932074427604675},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3705947995185852},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.09577757120132446},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00453-022-01035-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-01035-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01035-6.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:36843","is_oa":true,"landing_page_url":"http://dro.dur.ac.uk/36843/","pdf_url":"https://durham-repository.worktribe.com/preview/1193117/36843VoR.pdf","source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 2023, Vol.85(2), pp.406-443 [Peer Reviewed Journal]","raw_type":"Article"},{"id":"pmh:oai:durham-repository.worktribe.com:1193092","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1193092","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:figshare.com:article/13643063","is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/Round-Competitive_Algorithms_for_Uncertainty_Problems_with_Parallel_Queries/13643063","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1007/s00453-022-01035-6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-022-01035-6","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-022-01035-6.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1127001923","display_name":"Algorithms for Computing with Uncertainty: Theory and Experiments","funder_award_id":"EP/S033483/2","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G1934935867","display_name":null,"funder_award_id":"Engineering and Physical Sciences R","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G2650624950","display_name":null,"funder_award_id":"EP/S033483/2","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3448245257","display_name":null,"funder_award_id":"EP/S033483/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6402544442","display_name":"Algorithms for Computing with Uncertainty: Theory and Experiments","funder_award_id":"EP/S033483/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320320276","display_name":"University of Leicester","ror":"https://ror.org/04h699437"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3120251268.pdf","grobid_xml":"https://content.openalex.org/works/W3120251268.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W59523525","https://openalex.org/W132058294","https://openalex.org/W1517921658","https://openalex.org/W1552828154","https://openalex.org/W1584796555","https://openalex.org/W1602423797","https://openalex.org/W1966156872","https://openalex.org/W1973310391","https://openalex.org/W1973833593","https://openalex.org/W1973911938","https://openalex.org/W2041077764","https://openalex.org/W2043675696","https://openalex.org/W2077048701","https://openalex.org/W2087590712","https://openalex.org/W2089939399","https://openalex.org/W2111367393","https://openalex.org/W2157615354","https://openalex.org/W2275305088","https://openalex.org/W2395778192","https://openalex.org/W2399017419","https://openalex.org/W2477988162","https://openalex.org/W2594013878","https://openalex.org/W2751030676","https://openalex.org/W2808073262","https://openalex.org/W2962806151","https://openalex.org/W2966645553","https://openalex.org/W3010767822","https://openalex.org/W3041182549","https://openalex.org/W3088107432","https://openalex.org/W3145083791","https://openalex.org/W3183786176","https://openalex.org/W6611322977","https://openalex.org/W6775276261","https://openalex.org/W6960834232","https://openalex.org/W6966620167"],"related_works":["https://openalex.org/W2739612537","https://openalex.org/W2349174696","https://openalex.org/W2360241746","https://openalex.org/W4313041667","https://openalex.org/W2767599893","https://openalex.org/W2381572297","https://openalex.org/W3114770763","https://openalex.org/W2106741186","https://openalex.org/W2368890809","https://openalex.org/W4298146145"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"computing":[2],"with":[3,98,166],"explorable":[4],"uncertainty,":[5],"one":[6],"considers":[7],"problems":[8,127],"where":[9,37,55,254],"the":[10,35,67,72,87,99,106,126,136,140,149,153,157,189,265],"values":[11],"of":[12,74,89,102,112,118,121,128,134,143,155,173,268],"some":[13],"input":[14],"elements":[15,114,165],"are":[16,39],"uncertain,":[17],"typically":[18],"represented":[19],"as":[20],"intervals,":[21],"but":[22],"can":[23,58],"be":[24,59],"obtained":[25],"using":[26],"queries.":[27],"Previous":[28],"work":[29],"has":[30],"considered":[31],"query":[32,75,90,103,237,269],"minimization":[33],"in":[34,61,63,96,169],"settings":[36],"queries":[38,57],"asked":[40],"sequentially":[41],"(adaptive":[42],"model)":[43],"or":[44],"all":[45,130,164],"at":[46,195],"once":[47],"(non-adaptive":[48],"model).":[49],"We":[50,146],"introduce":[51],"a":[52,110,116,170],"new":[53],"model":[54],"k":[56],"made":[60],"parallel":[62],"each":[64,144],"round,":[65],"and":[66,83,115,133,162,183,185],"goal":[68],"is":[69,264],"to":[70],"minimize":[71],"number":[73,88,101,267],"rounds.":[76,270],"Using":[77],"competitive":[78],"analysis,":[79],"we":[80,124],"present":[81],"upper":[82],"lower":[84],"bounds":[85],"on":[86],"rounds":[91,104,238],"required":[92],"by":[93],"any":[94],"algorithm":[95,187],"comparison":[97],"optimal":[100,266],"for":[105,181,188,239],"given":[107,171],"instance.":[108],"Given":[109],"set":[111,172],"uncertain":[113,174],"family":[117],"m":[119,131],"subsets":[120,132],"that":[122,167,193],"set,":[123],"study":[125,148],"sorting":[129,182],"determining":[135,156],"minimum":[137,141,190],"value":[138,161,168,191],"(or":[139],"element(s))":[142],"subset.":[145],"also":[147],"selection":[150,184],"problem,":[151],"i.e.,":[152],"problem":[154,192],"i":[158],"-th":[159],"smallest":[160],"identifying":[163],"elements.":[175],"Our":[176],"results":[177],"include":[178],"2-round-competitive":[179],"algorithms":[180],"an":[186],"uses":[194],"most":[196],"$$(2+\\varepsilon":[197],")":[198],"\\cdot":[199,205],"\\mathrm":[200],"{opt}_k+\\mathrm":[201],"{O}\\left(":[202],"\\frac{1}{\\varepsilon":[203],"}":[204],"\\lg":[206],"m\\right)":[207],"$$":[208],"<mml:math":[209,243,257],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[210,244,258],"<mml:mrow>":[211,212,245],"<mml:mo>(</mml:mo>":[213],"<mml:mn>2</mml:mn>":[214],"<mml:mo>+</mml:mo>":[215,224],"<mml:mi>\u03b5</mml:mi>":[216,229,248],"<mml:mo>)</mml:mo>":[217],"</mml:mrow>":[218,235,251],"<mml:mo>\u00b7</mml:mo>":[219,231],"<mml:msub>":[220,259],"<mml:mi>opt</mml:mi>":[221,260],"<mml:mi>k</mml:mi>":[222,261],"</mml:msub>":[223,262],"<mml:mi>O</mml:mi>":[225],"<mml:mfenced>":[226],"<mml:mfrac>":[227],"<mml:mn>1</mml:mn>":[228,250],"</mml:mfrac>":[230],"<mml:mo>lg</mml:mo>":[232],"<mml:mi>m</mml:mi>":[233],"</mml:mfenced>":[234],"</mml:math>":[236,252,263],"every":[240],"$$0&lt;\\varepsilon":[241],"&lt;1$$":[242],"<mml:mn>0</mml:mn>":[246],"<mml:mo>&lt;</mml:mo>":[247,249],",":[253],"$$\\mathrm":[255],"{opt}_k$$":[256]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}