{"id":"https://openalex.org/W2120881403","doi":"https://doi.org/10.1002/net.3230200302","title":"The probabilistic minimum spanning tree problem","display_name":"The probabilistic minimum spanning tree problem","publication_year":1990,"publication_date":"1990-05-01","ids":{"openalex":"https://openalex.org/W2120881403","doi":"https://doi.org/10.1002/net.3230200302","mag":"2120881403"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230200302","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230200302","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5025940525","display_name":"Dimitris Bertsimas","orcid":"https://orcid.org/0000-0002-1985-1003"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dimitris J. Bertsimas","raw_affiliation_strings":["Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139"],"affiliations":[{"raw_affiliation_string":"Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5025940525"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":15.3369,"has_fulltext":false,"cited_by_count":64,"citation_normalized_percentile":{"value":0.98696978,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"20","issue":"3","first_page":"245","last_page":"275"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9531999826431274,"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.9531999826431274,"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.9444000124931335,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8318760395050049},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7465286254882812},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.7335124015808105},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.7089925408363342},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6642770767211914},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6542534232139587},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6378517746925354},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6358778476715088},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49710801243782043},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.45663362741470337},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.4342651963233948},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4330779016017914},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.42208120226860046},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.42105865478515625},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.4126734733581543},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39288491010665894},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3623383641242981},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.2072296142578125},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.11237043142318726}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8318760395050049},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7465286254882812},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.7335124015808105},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.7089925408363342},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6642770767211914},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6542534232139587},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6378517746925354},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6358778476715088},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49710801243782043},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.45663362741470337},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.4342651963233948},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4330779016017914},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.42208120226860046},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.42105865478515625},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.4126734733581543},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39288491010665894},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3623383641242981},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.2072296142578125},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.11237043142318726},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1002/net.3230200302","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230200302","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.207.6748","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.207.6748","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/dbertsim/www/papers/Vehicle%20Routing/The%20probabilistic%20minimum%20spanning%20tree%20problem.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.392.8409","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.392.8409","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cs.ucsb.edu/~suri/cs231/Rlist/pmst.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1500165591","https://openalex.org/W1576498301","https://openalex.org/W1993966762","https://openalex.org/W2011039300","https://openalex.org/W2014068360","https://openalex.org/W2016218947","https://openalex.org/W2024631575","https://openalex.org/W2029565994","https://openalex.org/W2047221217","https://openalex.org/W2053913299","https://openalex.org/W2054812794","https://openalex.org/W2107102056","https://openalex.org/W2159266476","https://openalex.org/W3011766368","https://openalex.org/W4247219061","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2943635264","https://openalex.org/W1576317141","https://openalex.org/W3081212354","https://openalex.org/W3132067041","https://openalex.org/W1958279402","https://openalex.org/W3010374802","https://openalex.org/W4287325277","https://openalex.org/W4239736023","https://openalex.org/W2010585027","https://openalex.org/W2095481180"],"abstract_inverted_index":{"Abstract":[0],"In":[1,28,177],"this":[2],"paper":[3],"we":[4,19,30,73,128],"consider":[5,31],"a":[6,57,65,144],"natural":[7],"probabilistic":[8,22],"variation":[9],"of":[10,52,64,88,94,123,171],"the":[11,21,32,37,50,53,61,76,89,92,95,98,101,110,120,130,133,138,148,151,160,165,169,172,180],"classical":[12],"minimum":[13,23],"spanning":[14,24,67],"tree":[15,25],"problem":[16,26,77,111],"(MST),":[17],"which":[18,127,154,168],"call":[20],"(PMST).":[27],"particular,":[29],"case":[33,152,166],"where":[34,109],"not":[35],"all":[36],"points":[38,139,155],"are":[39,43,141,156,174],"deterministically":[40],"present,":[41],"but":[42],"present":[44,142],"with":[45,97],"certain":[46],"probability.":[47],"We":[48,81,117],"discuss":[49],"applications":[51],"PMST":[54,96,181],"and":[55,100,105,147,163],"find":[56,129],"closed\u2010form":[58],"expression":[59],"for":[60],"expected":[62],"length":[63],"given":[66],"tree.":[68],"Based":[69],"on":[70,143],"these":[71],"expressions,":[72],"prove":[74],"that":[75,140],"is":[78,112,182],"NP\u2010complete":[79],".":[80],"further":[82],"examine":[83,106],"some":[84,107],"interesting":[85],"combinatorial":[86],"properties":[87],"problem,":[90,104],"establish":[91],"relation":[93],"MST":[99,131],"network":[102],"design":[103],"cases":[108,179],"solvable":[113],"in":[114,126,150,153,159,164,167],"polynomial":[115],"time.":[116],"finally":[118],"characterize":[119],"asymptotic":[121],"behavior":[122],"reoptimization":[124],"strategies,":[125],"or":[132],"Steiner":[134],"tree,":[135],"respectively,":[136],"among":[137],"particular":[145],"instance,":[146],"PMST,":[149],"randomly":[157,175],"distributed":[158],"Euclidean":[161],"plane":[162],"costs":[170],"ares":[173],"distributed.":[176],"both":[178,187],"within":[183],"constant":[184],"factors":[185],"from":[186],"strategies.":[188]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}