{"id":"https://openalex.org/W2117879716","doi":"https://doi.org/10.1007/s10852-011-9165-1","title":"On the probabilistic min spanning tree Problem","display_name":"On the probabilistic min spanning tree Problem","publication_year":2011,"publication_date":"2011-10-24","ids":{"openalex":"https://openalex.org/W2117879716","doi":"https://doi.org/10.1007/s10852-011-9165-1","mag":"2117879716"},"language":"en","primary_location":{"id":"doi:10.1007/s10852-011-9165-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10852-011-9165-1","pdf_url":null,"source":{"id":"https://openalex.org/S80764785","display_name":"Journal of Mathematical Modelling and Algorithms","issn_l":"1570-1166","issn":["1570-1166","1572-9214"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Mathematical Modelling and Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-00875638/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040388852","display_name":"Nicolas Boria","orcid":"https://orcid.org/0000-0002-0548-4257"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nicolas Boria","raw_affiliation_strings":["LAMSADE, CNRS and Universit\u00e9 Paris-Dauphine, Paris cedex 16, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LAMSADE, CNRS and Universit\u00e9 Paris-Dauphine, Paris cedex 16, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I56435720"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037346228","display_name":"C\u00e9cile Murat","orcid":"https://orcid.org/0000-0001-8888-3685"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"C\u00e9cile Murat","raw_affiliation_strings":["LAMSADE, CNRS and Universit\u00e9 Paris-Dauphine, Paris cedex 16, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LAMSADE, CNRS and Universit\u00e9 Paris-Dauphine, Paris cedex 16, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I56435720"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110275522","display_name":"Vangelis Th. Paschos","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I185839726","display_name":"Institut Universitaire de France","ror":"https://ror.org/055khg266","country_code":"FR","type":"education","lineage":["https://openalex.org/I185839726"]},{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Vangelis Paschos","raw_affiliation_strings":["Institut Universitaire de France, Paris, France","LAMSADE, CNRS and Universit\u00e9 Paris-Dauphine, Paris cedex 16, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut Universitaire de France, Paris, France","institution_ids":["https://openalex.org/I185839726"]},{"raw_affiliation_string":"LAMSADE, CNRS and Universit\u00e9 Paris-Dauphine, Paris cedex 16, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I56435720"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5037346228"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I56435720"],"apc_list":null,"apc_paid":null,"fwci":1.1869,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.7978035,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"11","issue":"1","first_page":"45","last_page":"76"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"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/spanning-tree","display_name":"Spanning tree","score":0.8553417921066284},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7140430808067322},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6883445978164673},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.6675560474395752},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.6454054117202759},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.6259192228317261},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.620472252368927},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5196053385734558},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.512978732585907},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.509865403175354},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.48557180166244507},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.47259077429771423},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4310447573661804},{"id":"https://openalex.org/keywords/gomory\u2013hu-tree","display_name":"Gomory\u2013Hu tree","score":0.4253199100494385},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4136466979980469},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36245933175086975},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3041851818561554},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.14788982272148132},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.05544489622116089}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8553417921066284},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7140430808067322},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6883445978164673},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.6675560474395752},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.6454054117202759},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.6259192228317261},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.620472252368927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5196053385734558},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.512978732585907},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.509865403175354},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.48557180166244507},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.47259077429771423},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4310447573661804},{"id":"https://openalex.org/C147517495","wikidata":"https://www.wikidata.org/wiki/Q5581241","display_name":"Gomory\u2013Hu tree","level":5,"score":0.4253199100494385},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4136466979980469},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36245933175086975},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3041851818561554},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.14788982272148132},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.05544489622116089}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1007/s10852-011-9165-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10852-011-9165-1","pdf_url":null,"source":{"id":"https://openalex.org/S80764785","display_name":"Journal of Mathematical Modelling and Algorithms","issn_l":"1570-1166","issn":["1570-1166","1572-9214"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Mathematical Modelling and Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-00875638v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00875638","pdf_url":"https://hal.science/hal-00875638/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2011","raw_type":"info:eu-repo/semantics/preprint"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.386.5470","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.386.5470","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lamsade.dauphine.fr/sites/default/IMG/pdf/cahier306.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.406.5369","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.5369","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hal.inria.fr/docs/00/87/56/38/PDF/cahier_306.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01495334v1","is_oa":true,"landing_page_url":"https://hal.science/hal-01495334","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Mathematical Modelling and Algorithms, 2012, 11 (1), pp.45-76. ⟨10.1007/s10852-011-9165-1⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:basepub.dauphine.fr:123456789/6306","is_oa":true,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/6306","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"},{"id":"pmh:oai:basepub.dauphine.fr:123456789/7372","is_oa":false,"landing_page_url":"https://basepub.dauphine.fr/handle/123456789/7372","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article accept\u00e9 pour publication ou publi\u00e9"},{"id":"pmh:oai:porto.polito.it:2500160","is_oa":true,"landing_page_url":"http://porto.polito.it/2500160/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402038","display_name":"PORTO Publications Open Repository TOrino (Politecnico di Torino)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177477856","host_organization_name":"Politecnico di Torino","host_organization_lineage":["https://openalex.org/I177477856"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1570-1166","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:porto.polito.it:2500164","is_oa":true,"landing_page_url":"http://porto.polito.it/2500164/1/pmst.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306402038","display_name":"PORTO Publications Open Repository TOrino (Politecnico di Torino)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177477856","host_organization_name":"Politecnico di Torino","host_organization_lineage":["https://openalex.org/I177477856"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00875638v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00875638","pdf_url":"https://hal.science/hal-00875638/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2011","raw_type":"info:eu-repo/semantics/preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2117879716.pdf"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W620344865","https://openalex.org/W849000906","https://openalex.org/W1484958883","https://openalex.org/W1500165591","https://openalex.org/W1557310162","https://openalex.org/W1569990960","https://openalex.org/W1576498301","https://openalex.org/W1585652832","https://openalex.org/W1963888335","https://openalex.org/W1965680834","https://openalex.org/W1973942323","https://openalex.org/W1983688269","https://openalex.org/W1985498227","https://openalex.org/W1986022261","https://openalex.org/W1998325433","https://openalex.org/W2000181075","https://openalex.org/W2007917614","https://openalex.org/W2011039300","https://openalex.org/W2014561394","https://openalex.org/W2027167948","https://openalex.org/W2027954882","https://openalex.org/W2032841680","https://openalex.org/W2070206118","https://openalex.org/W2070627531","https://openalex.org/W2085725603","https://openalex.org/W2094806178","https://openalex.org/W2120881403","https://openalex.org/W2128865241","https://openalex.org/W2129557546","https://openalex.org/W2143466467","https://openalex.org/W2143863355","https://openalex.org/W2163290667","https://openalex.org/W2617045890","https://openalex.org/W2798344481","https://openalex.org/W3106992008","https://openalex.org/W3145128584","https://openalex.org/W4213072488","https://openalex.org/W4246185962","https://openalex.org/W4251495539","https://openalex.org/W4253347690","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1985149601","https://openalex.org/W1997570556","https://openalex.org/W2943635264","https://openalex.org/W2058332489","https://openalex.org/W1576317141","https://openalex.org/W4239736023","https://openalex.org/W2074417667","https://openalex.org/W2117879716","https://openalex.org/W2071845176","https://openalex.org/W1958279402"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}