{"id":"https://openalex.org/W2036686829","doi":"https://doi.org/10.1145/1998196.1998206","title":"Stochastic minimum spanning trees in euclidean spaces","display_name":"Stochastic minimum spanning trees in euclidean spaces","publication_year":2011,"publication_date":"2011-06-13","ids":{"openalex":"https://openalex.org/W2036686829","doi":"https://doi.org/10.1145/1998196.1998206","mag":"2036686829"},"language":"en","primary_location":{"id":"doi:10.1145/1998196.1998206","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1998196.1998206","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-seventh annual symposium on Computational geometry","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/A5046945057","display_name":"Pegah Kamousi","orcid":null},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Pegah Kamousi","raw_affiliation_strings":["UC Santa Barbara, Santa Barbara, CA, USA"],"affiliations":[{"raw_affiliation_string":"UC Santa Barbara, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032955418","display_name":"Timothy M. Chan","orcid":"https://orcid.org/0000-0002-8093-0675"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Timothy M. Chan","raw_affiliation_strings":["University of Waterloo, Waterloo, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of Waterloo, Waterloo, CA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072397842","display_name":"Subhash Suri","orcid":"https://orcid.org/0000-0002-5668-7521"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Subhash Suri","raw_affiliation_strings":["UC Santa Barbara, Santa Barbara, CA, USA"],"affiliations":[{"raw_affiliation_string":"UC Santa Barbara, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5046945057"],"corresponding_institution_ids":["https://openalex.org/I154570441"],"apc_list":null,"apc_paid":null,"fwci":13.4508,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.98577803,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"65","last_page":"74"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9962000250816345,"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.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.8425344228744507},{"id":"https://openalex.org/keywords/euclidean-minimum-spanning-tree","display_name":"Euclidean minimum spanning tree","score":0.8260220289230347},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7737952470779419},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.6774252653121948},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.574005126953125},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5386775135993958},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5172063112258911},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5079031586647034},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.49355947971343994},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4611978232860565},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44472160935401917},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4302651882171631},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4292854368686676},{"id":"https://openalex.org/keywords/stochastic-geometry","display_name":"Stochastic geometry","score":0.4194284975528717},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37801796197891235},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3247002959251404},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32206231355667114},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.31276261806488037},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2215999960899353},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1718059778213501}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.8425344228744507},{"id":"https://openalex.org/C145685049","wikidata":"https://www.wikidata.org/wiki/Q4454941","display_name":"Euclidean minimum spanning tree","level":4,"score":0.8260220289230347},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7737952470779419},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.6774252653121948},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.574005126953125},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5386775135993958},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5172063112258911},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5079031586647034},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.49355947971343994},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4611978232860565},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44472160935401917},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4302651882171631},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4292854368686676},{"id":"https://openalex.org/C31243852","wikidata":"https://www.wikidata.org/wiki/Q1666739","display_name":"Stochastic geometry","level":2,"score":0.4194284975528717},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37801796197891235},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3247002959251404},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32206231355667114},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.31276261806488037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2215999960899353},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1718059778213501},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1998196.1998206","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1998196.1998206","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-seventh annual symposium on Computational geometry","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W55191700","https://openalex.org/W64120297","https://openalex.org/W1505970908","https://openalex.org/W1576498301","https://openalex.org/W1598073724","https://openalex.org/W1966612958","https://openalex.org/W1981673685","https://openalex.org/W1982280823","https://openalex.org/W1987387255","https://openalex.org/W1993966762","https://openalex.org/W1998076865","https://openalex.org/W2002025203","https://openalex.org/W2002041206","https://openalex.org/W2002285507","https://openalex.org/W2007553965","https://openalex.org/W2014068360","https://openalex.org/W2042492403","https://openalex.org/W2044027392","https://openalex.org/W2058312407","https://openalex.org/W2063295648","https://openalex.org/W2081541119","https://openalex.org/W2089841750","https://openalex.org/W2094974501","https://openalex.org/W2105946172","https://openalex.org/W2107989318","https://openalex.org/W2110367141","https://openalex.org/W2129557546","https://openalex.org/W2147322117","https://openalex.org/W2150217455","https://openalex.org/W2159266476","https://openalex.org/W2165142526","https://openalex.org/W2172030265","https://openalex.org/W2295428206","https://openalex.org/W2950520620"],"related_works":["https://openalex.org/W2183553443","https://openalex.org/W2384039237","https://openalex.org/W2144570496","https://openalex.org/W3036915266","https://openalex.org/W2059360098","https://openalex.org/W1981480054","https://openalex.org/W98489388","https://openalex.org/W1839838225","https://openalex.org/W2979085363","https://openalex.org/W2053792000"],"abstract_inverted_index":{"We":[0,44],"study":[1],"the":[2,48,52,58,70,89,98],"complexity":[3],"of":[4,13,22,51,57,64,76,91],"geometric":[5,77],"minimum":[6,53],"spanning":[7,54],"trees":[8],"under":[9],"a":[10,19],"stochastic":[11,65],"model":[12],"input:":[14],"Suppose":[15],"we":[16],"are":[17],"given":[18],"master":[20],"set":[21],"points":[23],"s1,s_2,...,sn":[24],"in":[25,73,85],"d-dimensional":[26],"Euclidean":[27],"space,":[28],"where":[29],"each":[30],"point":[31],"si":[32],"is":[33,67],"active":[34,59],"with":[35],"some":[36],"independent":[37],"and":[38],"arbitrary":[39],"but":[40,79],"known":[41],"probability":[42],"pi.":[43],"want":[45],"to":[46,88],"compute":[47],"expected":[49],"length":[50],"tree":[55],"(MST)":[56],"points.":[60],"This":[61],"particular":[62],"form":[63],"problems":[66],"motivated":[68],"by":[69],"uncertainty":[71],"inherent":[72],"many":[74],"sources":[75],"data":[78],"has":[80],"not":[81],"been":[82],"investigated":[83],"before":[84],"computational":[86],"geometry":[87],"best":[90],"our":[92],"knowledge.":[93],"Our":[94],"main":[95],"results":[96],"include":[97],"following.":[99]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":5}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}