{"id":"https://openalex.org/W2399017419","doi":"https://doi.org/10.1137/16m1088375","title":"Randomization Helps Computing a Minimum Spanning Tree under Uncertainty","display_name":"Randomization Helps Computing a Minimum Spanning Tree under Uncertainty","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2399017419","doi":"https://doi.org/10.1137/16m1088375","mag":"2399017419"},"language":"en","primary_location":{"id":"doi:10.1137/16m1088375","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1088375","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/A5073490534","display_name":"Nicole Megow","orcid":"https://orcid.org/0000-0002-3531-7644"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Nicole Megow","raw_affiliation_strings":["Technische Universit\u00e4t"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058622590","display_name":"Julie Mei\u00dfner","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Julie Mei\u00dfner","raw_affiliation_strings":["Technische Universit\u00e4t"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055693054","display_name":"Martin Skutella","orcid":"https://orcid.org/0000-0002-9814-1703"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Martin Skutella","raw_affiliation_strings":["Technische Universit\u00e4t"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5073490534"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5327,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.8457671,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"46","issue":"4","first_page":"1217","last_page":"1240"},"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.9991999864578247,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7367773056030273},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.7343543767929077},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6755800247192383},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6390682458877563},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.595115065574646},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5181207060813904},{"id":"https://openalex.org/keywords/approx","display_name":"Approx","score":0.4868423342704773},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.4734511077404022},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4394005835056305},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43289294838905334},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4275643229484558},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4275552034378052},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.42529845237731934},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.41198158264160156},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.1396651268005371},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06913572549819946}],"concepts":[{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7367773056030273},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.7343543767929077},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6755800247192383},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6390682458877563},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.595115065574646},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5181207060813904},{"id":"https://openalex.org/C2777894999","wikidata":"https://www.wikidata.org/wiki/Q4781758","display_name":"Approx","level":2,"score":0.4868423342704773},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.4734511077404022},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4394005835056305},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43289294838905334},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4275643229484558},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4275552034378052},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.42529845237731934},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.41198158264160156},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.1396651268005371},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06913572549819946},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/16m1088375","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1088375","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":[{"display_name":"Partnerships for the goals","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/17"}],"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"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320323688","display_name":"Einstein Stiftung Berlin","ror":"https://ror.org/03s0fv852"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W59523525","https://openalex.org/W232024102","https://openalex.org/W1535323908","https://openalex.org/W1552828154","https://openalex.org/W1569990960","https://openalex.org/W1602423797","https://openalex.org/W1966156872","https://openalex.org/W1973833593","https://openalex.org/W2012080718","https://openalex.org/W2041077764","https://openalex.org/W2077048701","https://openalex.org/W2089939399","https://openalex.org/W2157615354","https://openalex.org/W2242792420","https://openalex.org/W2275305088","https://openalex.org/W2295981146","https://openalex.org/W2998757566"],"related_works":["https://openalex.org/W2898459690","https://openalex.org/W3101457564","https://openalex.org/W2589768050","https://openalex.org/W4380840098","https://openalex.org/W2014815983","https://openalex.org/W4242086819","https://openalex.org/W2074214908","https://openalex.org/W4206043061","https://openalex.org/W1558455962","https://openalex.org/W2274518162"],"abstract_inverted_index":{"Given":[0],"a":[1,13,49,77],"graph":[2],"with":[3,52,80],"\u201cuncertainty":[4],"intervals\u201d":[5],"on":[6],"the":[7,29,38,87],"edges,":[8],"we":[9],"want":[10],"to":[11,36],"identify":[12],"minimum":[14],"spanning":[15],"tree":[16],"by":[17],"querying":[18,132],"some":[19],"edges":[20],"for":[21,123],"their":[22],"exact":[23],"edge":[24,41],"weights":[25],"which":[26],"lie":[27],"in":[28,62],"given":[30],"uncertainty":[31],"intervals.":[32],"Our":[33,73],"objective":[34],"is":[35,44,48,76],"minimize":[37],"number":[39],"of":[40,64,91],"queries.":[42],"It":[43],"known":[45],"that":[46],"there":[47],"deterministic":[50],"algorithm":[51,79],"best":[53],"possible":[54],"competitive":[55,82,95],"ratio":[56,83,96],"2":[57,100],"[T.":[58,104],"Erlebach,":[59],"et":[60],"al.,":[61],"Proceedings":[63],"STACS,":[65],"Schloss":[66],"Dagstuhl,":[67,68],"Germany,":[69],"2008,":[70],"pp.":[71],"277--288].":[72],"main":[74],"result":[75],"randomized":[78],"expected":[81,94],"$1+1/\\sqrt{2}\\approx":[84],"1.707$,":[85],"solving":[86],"long-standing":[88],"open":[89],"problem":[90],"whether":[92],"an":[93],"strictly":[97],"less":[98],"than":[99],"can":[101],"be":[102],"achieved":[103],"Erlebach":[105],"and":[106,129],"M.":[107],"Hoffmann,":[108],"Bull.":[109],"Eur.":[110],"Assoc.":[111],"Theor.":[112],"Comput.":[113],"Sci.":[114],"EATCS,":[115],"116":[116],"(2015)].":[117],"We":[118],"also":[119],"present":[120],"novel":[121],"results":[122],"various":[124],"extensions,":[125],"including":[126],"arbitrary":[127],"matroids":[128],"more":[130],"general":[131],"models.":[133]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":5},{"year":2018,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}