{"id":"https://openalex.org/W2809834751","doi":"https://doi.org/10.1142/s0129054118410034","title":"Online Minimum Spanning Tree with Advice","display_name":"Online Minimum Spanning Tree with Advice","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2809834751","doi":"https://doi.org/10.1142/s0129054118410034","mag":"2809834751"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054118410034","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054118410034","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of 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/A5070155938","display_name":"Maria Paola Bianchi","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Maria Paola Bianchi","raw_affiliation_strings":["Z\u00fchlke Engineering AG, Switzerland"],"affiliations":[{"raw_affiliation_string":"Z\u00fchlke Engineering AG, Switzerland","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086921684","display_name":"Hans-Joachim B\u00f6ckenhauer","orcid":"https://orcid.org/0000-0001-9164-3674"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Hans-Joachim B\u00f6ckenhauer","raw_affiliation_strings":["Department of Computer Science, ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005115828","display_name":"Tatjana Br\u00fclisauer","orcid":null},"institutions":[{"id":"https://openalex.org/I4210100430","display_name":"Google (Switzerland)","ror":"https://ror.org/014f9c269","country_code":"CH","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210100430","https://openalex.org/I4210128969"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Tatjana Br\u00fclisauer","raw_affiliation_strings":["Google Inc., Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Google Inc., Zurich, Switzerland","institution_ids":["https://openalex.org/I4210100430"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033151596","display_name":"Dennis Komm","orcid":"https://orcid.org/0000-0002-9024-1558"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Dennis Komm","raw_affiliation_strings":["Department of Computer Science, ETH Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073652157","display_name":"Beatrice Palano","orcid":"https://orcid.org/0000-0003-3948-4658"},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Beatrice Palano","raw_affiliation_strings":["Dipartimento di Informatica \u201cGiovanni Degli Antoni\u201d, Universit\u00e0 degli Studi di Milano via Comelico 39, 20135 Milano, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica \u201cGiovanni Degli Antoni\u201d, Universit\u00e0 degli Studi di Milano via Comelico 39, 20135 Milano, Italy","institution_ids":["https://openalex.org/I189158943"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5070155938"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3691,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.63377639,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"29","issue":"04","first_page":"505","last_page":"527"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9869999885559082,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9830999970436096,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6258577704429626},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6246924996376038},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5984817743301392},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5912720561027527},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5809924602508545},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5757299065589905},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5647031664848328},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.55876225233078},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.539987325668335},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4858679175376892},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4850105941295624},{"id":"https://openalex.org/keywords/advice","display_name":"Advice (programming)","score":0.46237799525260925},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4454614520072937},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4282236099243164},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4218195080757141},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25750988721847534},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19898861646652222}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6258577704429626},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6246924996376038},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5984817743301392},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5912720561027527},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5809924602508545},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5757299065589905},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5647031664848328},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.55876225233078},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.539987325668335},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4858679175376892},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4850105941295624},{"id":"https://openalex.org/C2779955035","wikidata":"https://www.wikidata.org/wiki/Q4686785","display_name":"Advice (programming)","level":2,"score":0.46237799525260925},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4454614520072937},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4282236099243164},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4218195080757141},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25750988721847534},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19898861646652222},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"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.1142/s0129054118410034","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054118410034","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W19276351","https://openalex.org/W1513400187","https://openalex.org/W1552828154","https://openalex.org/W1965680834","https://openalex.org/W1998894390","https://openalex.org/W2013227361","https://openalex.org/W2020254384","https://openalex.org/W2038445565","https://openalex.org/W2040556211","https://openalex.org/W2041645394","https://openalex.org/W2106260425","https://openalex.org/W2109659895","https://openalex.org/W2113286397","https://openalex.org/W2128777897","https://openalex.org/W2469267808","https://openalex.org/W2578333369","https://openalex.org/W2595319805","https://openalex.org/W2606892140","https://openalex.org/W2626350546"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W2099915933","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2418231958","https://openalex.org/W2583614279","https://openalex.org/W2049627958"],"abstract_inverted_index":{"In":[0],"the":[1,57,65,90,121,141,145,149,171,177,183,186,192,214,233,243],"online":[2,30,50,205,240],"minimum":[3],"spanning":[4],"tree":[5],"problem,":[6,244],"a":[7,35,40,53,72,113,160,201,209,229],"graph":[8,73,106,150],"is":[9,52,151],"revealed":[10],"vertex":[11],"by":[12],"vertex;":[13],"together":[14],"with":[15,109,248],"every":[16],"vertex,":[17],"all":[18],"edges":[19],"to":[20,55,61,67,95,135,207,227],"vertices":[21],"that":[22,59,120],"are":[23,26],"already":[24],"known":[25],"given,":[27],"and":[28,153,191],"an":[29,49,81,97,137],"algorithm":[31,175,241],"must":[32],"irrevocably":[33],"choose":[34],"subset":[36],"of":[37,42,48,74,85,92,165,170,173,188,237],"them":[38],"as":[39],"part":[41],"its":[43],"solution.":[44,220],"The":[45],"advice":[46,93,132,189,215],"complexity":[47,216],"problem":[51,206],"means":[54],"quantify":[56],"information":[58],"needs":[60],"be":[62,125],"extracted":[63],"from":[64,203],"input":[66],"achieve":[68],"good":[69],"results.":[70],"For":[71,104],"size":[75],"[Formula:":[76,86,129],"see":[77,87,130],"text],":[78],"we":[79,118,199],"show":[80],"asymptotically":[82],"tight":[83],"bound":[84,123,212,231],"text]":[88,131],"on":[89,213,232,246],"number":[91,162,187],"bits":[94,133,190],"produce":[96],"optimal":[98,138],"solution":[99],"for":[100,176,217,242],"any":[101,218,238],"given":[102],"graph.":[103],"particular":[105],"classes,":[107],"e.g.,":[108,128],"bounded":[110],"degree":[111],"or":[112],"restricted":[114],"edge":[115,157,251],"weight":[116,142],"function,":[117],"prove":[119],"upper":[122],"can":[124],"drastically":[126],"reduced;":[127],"allow":[134],"compute":[136],"result":[139],"if":[140,148],"function":[143],"equals":[144],"Euclidean":[146],"distance;":[147],"complete":[152],"has":[154],"two":[155],"different":[156,250],"weights,":[158],"even":[159,245],"logarithmic":[161],"suffices.":[163],"Some":[164],"these":[166],"results":[167,223],"make":[168],"use":[169],"optimality":[172],"Kruskal\u2019s":[174],"offline":[178],"setting.":[179],"We":[180],"also":[181],"study":[182],"trade-off":[184],"between":[185],"achievable":[193],"competitive":[194,235],"ratio.":[195],"To":[196],"this":[197],"end,":[198],"perform":[200],"reduction":[202],"another":[204],"obtain":[208],"linear":[210],"lower":[211,230],"near-optimal":[219],"Using":[221],"our":[222],"finally":[224],"allows":[225],"us":[226],"give":[228],"expected":[234],"ratio":[236],"randomized":[239],"graphs":[247],"three":[249],"weights.":[252]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}