{"id":"https://openalex.org/W3103514293","doi":"https://doi.org/10.1145/3422371","title":"Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments","display_name":"Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments","publication_year":2020,"publication_date":"2020-11-08","ids":{"openalex":"https://openalex.org/W3103514293","doi":"https://doi.org/10.1145/3422371","mag":"3103514293"},"language":"en","primary_location":{"id":"doi:10.1145/3422371","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3422371","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","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/A5002287702","display_name":"Jacob Focke","orcid":"https://orcid.org/0000-0002-6895-755X"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Jacob Focke","raw_affiliation_strings":["University of Oxford, Oxford, UK"],"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073490534","display_name":"Nicole Megow","orcid":"https://orcid.org/0000-0002-3531-7644"},"institutions":[{"id":"https://openalex.org/I4210141311","display_name":"Staats- und Universit\u00e4tsbibliothek Bremen","ror":"https://ror.org/04cwb1p56","country_code":"DE","type":"archive","lineage":["https://openalex.org/I180437899","https://openalex.org/I4210141311"]},{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Nicole Megow","raw_affiliation_strings":["University of Bremen, Bibliothekstra\u00dfe, Bremen, Germany"],"affiliations":[{"raw_affiliation_string":"University of Bremen, Bibliothekstra\u00dfe, Bremen, Germany","institution_ids":["https://openalex.org/I4210141311","https://openalex.org/I180437899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058622590","display_name":"Julie Mei\u00dfner","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Julie Mei\u00dfner","raw_affiliation_strings":["Technical University of Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Technical University of Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002287702"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":0.8976,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.78252346,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"25","issue":null,"first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9987000226974487,"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"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9987000226974487,"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/T10050","display_name":"Multi-Criteria Decision Making","score":0.9927999973297119,"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/T12135","display_name":"Fuzzy Systems and Optimization","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7942895889282227},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.6576092839241028},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5904070138931274},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5849288702011108},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.48653164505958557},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47488564252853394},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.44866546988487244},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43404752016067505},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4301309883594513},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4217797517776489},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.41764187812805176},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41619473695755005},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35216131806373596},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2622607350349426},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2137218415737152},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20299223065376282},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14629009366035461}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7942895889282227},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.6576092839241028},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5904070138931274},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5849288702011108},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.48653164505958557},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47488564252853394},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.44866546988487244},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43404752016067505},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4301309883594513},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4217797517776489},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.41764187812805176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41619473695755005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35216131806373596},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2622607350349426},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2137218415737152},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20299223065376282},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14629009366035461}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3422371","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3422371","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6283469581","display_name":null,"funder_award_id":"ME 3825/1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G8977314523","display_name":"DTP - University of Oxford","funder_award_id":"EP/M508111/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W59523525","https://openalex.org/W1552828154","https://openalex.org/W1569990960","https://openalex.org/W1966156872","https://openalex.org/W2041077764","https://openalex.org/W2077048701","https://openalex.org/W2089939399","https://openalex.org/W2157615354","https://openalex.org/W2163428398","https://openalex.org/W2275305088","https://openalex.org/W2395778192","https://openalex.org/W2399017419","https://openalex.org/W2751030676","https://openalex.org/W4213060235","https://openalex.org/W4251616545","https://openalex.org/W6966620167"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W2390742649","https://openalex.org/W3101281637","https://openalex.org/W1561849181"],"abstract_inverted_index":{"We":[0,118],"consider":[1],"the":[2,21,33,46,55,75,82,86,95,115,150],"minimum":[3,34],"spanning":[4],"tree":[5],"(MST)":[6],"problem":[7,39],"in":[8,143],"an":[9,29,109,141],"uncertainty":[10,146],"model":[11],"where":[12],"interval":[13],"edge":[14],"weights":[15],"can":[16],"be":[17],"explored":[18],"to":[19,27,128],"obtain":[20],"exact":[22],"weight.":[23],"The":[24],"task":[25],"is":[26,126],"find":[28],"MST":[30,60],"by":[31,130],"querying":[32],"number":[35,88],"of":[36,74,89,123],"edges.":[37],"This":[38],"has":[40],"received":[41],"quite":[42],"some":[43],"attention":[44],"from":[45,94,140,149],"algorithms":[47],"theory":[48],"community.":[49],"In":[50],"this":[51],"article,":[52],"we":[53,79,100],"conduct":[54],"first":[56],"practical":[57,72,138],"experiments":[58,134],"for":[59],"under":[61],"uncertainty,":[62],"theoretically":[63],"compare":[64,69],"three":[65],"known":[66,103],"algorithms,":[67],"and":[68,85,107,145],"theoretical":[70,96],"with":[71],"behavior":[73],"algorithms.":[76],"Among":[77],"others,":[78],"observe":[80],"that":[81,112,125],"average":[83],"performance":[84],"absolute":[87],"queries":[90],"are":[91,135],"both":[92],"far":[93],"worst-case":[97],"bounds.":[98],"Furthermore,":[99],"investigate":[101],"a":[102,121],"general":[104],"preprocessing":[105],"procedure":[106],"develop":[108],"implementation":[110],"thereof":[111],"maximally":[113],"reduces":[114],"data":[116,139],"uncertainty.":[117],"also":[119],"characterize":[120],"class":[122],"instances":[124,147],"solved":[127],"optimality":[129],"our":[131],"preprocessing.":[132],"Our":[133],"based":[136],"on":[137],"application":[142],"telecommunications":[144],"generated":[148],"standard":[151],"TSPLib":[152],"graph":[153],"library.":[154]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}