{"id":"https://openalex.org/W2079589327","doi":"https://doi.org/10.1109/isit.2014.6875239","title":"How informative are Minimum Spanning Tree algorithms?","display_name":"How informative are Minimum Spanning Tree algorithms?","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2079589327","doi":"https://doi.org/10.1109/isit.2014.6875239","mag":"2079589327"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6875239","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875239","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-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/A5078274260","display_name":"Alexey Gronskiy","orcid":"https://orcid.org/0000-0003-3439-6288"},"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":true,"raw_author_name":"Alexey Gronskiy","raw_affiliation_strings":["Department of Computer Science, ETH Zurich","Department of Computer Science, ETH Zurich, Z\u00fcrich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Zurich","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"Department of Computer Science, ETH Zurich, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038199211","display_name":"Joachim M. Buhmann","orcid":"https://orcid.org/0000-0002-6613-7101"},"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":"Joachim M. Buhmann","raw_affiliation_strings":["Department of Computer Science, ETH Zurich","Department of Computer Science, ETH Zurich, Z\u00fcrich, Switzerland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ETH Zurich","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"Department of Computer Science, ETH Zurich, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078274260"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":3.6414,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.92781439,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"29","issue":null,"first_page":"2277","last_page":"2281"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9879999756813049,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11182","display_name":"Auction Theory and Applications","score":0.9879000186920166,"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/spanning-tree","display_name":"Spanning tree","score":0.8830993175506592},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.8383544683456421},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.7132955193519592},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.7063471078872681},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.6967967748641968},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6095473170280457},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.6076688170433044},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.5503675937652588},{"id":"https://openalex.org/keywords/prims-algorithm","display_name":"Prim's algorithm","score":0.5170279145240784},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5135996341705322},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4636247158050537},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.450755774974823},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4492354989051819},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4147379696369171},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.410361647605896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3671162724494934},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.29517340660095215}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8830993175506592},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.8383544683456421},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.7132955193519592},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.7063471078872681},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.6967967748641968},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6095473170280457},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.6076688170433044},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.5503675937652588},{"id":"https://openalex.org/C1649724","wikidata":"https://www.wikidata.org/wiki/Q470813","display_name":"Prim's algorithm","level":4,"score":0.5170279145240784},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5135996341705322},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4636247158050537},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.450755774974823},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4492354989051819},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4147379696369171},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.410361647605896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3671162724494934},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29517340660095215},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2014.6875239","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875239","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W115870532","https://openalex.org/W1502308049","https://openalex.org/W1686946872","https://openalex.org/W1902424748","https://openalex.org/W1968988178","https://openalex.org/W1985088226","https://openalex.org/W1986511870","https://openalex.org/W2055362601","https://openalex.org/W2142818506","https://openalex.org/W2478708596","https://openalex.org/W2549058804","https://openalex.org/W2797443475","https://openalex.org/W2979454998","https://openalex.org/W4206719239","https://openalex.org/W4285719527","https://openalex.org/W4302591315","https://openalex.org/W6604709371","https://openalex.org/W6637108112","https://openalex.org/W6749870390"],"related_works":["https://openalex.org/W2387385213","https://openalex.org/W4380840098","https://openalex.org/W3016811403","https://openalex.org/W2589768050","https://openalex.org/W2477124885","https://openalex.org/W2943635264","https://openalex.org/W3081212354","https://openalex.org/W2418231958","https://openalex.org/W1561849181","https://openalex.org/W2099915933"],"abstract_inverted_index":{"Searching":[0],"for":[1,88],"combinatorial":[2,94],"structures":[3],"in":[4,93],"weighted":[5],"graphs":[6],"with":[7,74],"stochastic":[8],"edge":[9],"weights":[10],"raises":[11],"the":[12,25,33,47,58,79],"issue":[13],"of":[14,24,36,42,49,63,70],"algorithmic":[15],"robustness.":[16],"In":[17],"this":[18],"paper,":[19],"we":[20],"investigate":[21],"noisy":[22],"versions":[23],"Minimum":[26],"Spanning":[27],"Tree":[28],"(MST)":[29],"problem":[30],"and":[31],"compare":[32],"generalization":[34],"properties":[35],"MST":[37,44,65],"algorithms.":[38],"An":[39],"information-theoretic":[40],"analysis":[41],"these":[43],"algorithms":[45],"measures":[46],"amount":[48],"information":[50],"on":[51],"spanning":[52,72,81],"trees":[53,73],"that":[54],"is":[55,96],"extracted":[56],"from":[57],"input":[59],"graph.":[60],"Early":[61],"stopping":[62],"an":[64],"algorithm":[66,89],"yields":[67],"a":[68],"set":[69],"approximate":[71],"increased":[75],"stability":[76],"compared":[77],"to":[78],"minimum":[80],"tree.":[82],"The":[83],"framework":[84],"also":[85],"provides":[86],"insights":[87],"design":[90],"when":[91],"noise":[92],"optimization":[95],"unavoidable.":[97]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}