{"id":"https://openalex.org/W2070582626","doi":"https://doi.org/10.1002/net.3230240303","title":"Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in <i>R<sup>d</sup></i>","display_name":"Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in <i>R<sup>d</sup></i>","publication_year":1994,"publication_date":"1994-05-01","ids":{"openalex":"https://openalex.org/W2070582626","doi":"https://doi.org/10.1002/net.3230240303","mag":"2070582626"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230240303","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230240303","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/A5020847214","display_name":"Konstantinos Kalpakis","orcid":"https://orcid.org/0000-0002-4827-2828"},"institutions":[{"id":"https://openalex.org/I79272384","display_name":"University of Maryland, Baltimore County","ror":"https://ror.org/02qskvh78","country_code":"US","type":"education","lineage":["https://openalex.org/I79272384"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Konstantinos Kalpakis","raw_affiliation_strings":["Computer Science Department, University of Maryland Baltimore County, Baltimore, Maryland 21228\u20135398"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Maryland Baltimore County, Baltimore, Maryland 21228\u20135398","institution_ids":["https://openalex.org/I79272384"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083555581","display_name":"Alan T. Sherman","orcid":"https://orcid.org/0000-0003-1130-4678"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]},{"id":"https://openalex.org/I79272384","display_name":"University of Maryland, Baltimore County","ror":"https://ror.org/02qskvh78","country_code":"US","type":"education","lineage":["https://openalex.org/I79272384"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan T. Sherman","raw_affiliation_strings":["Computer Science Department, University of Maryland Baltimore County, Baltimore, Maryland 21228\u20135398","Member, Institute for Advanced Computer Studies, University of Maryland, College Park"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Maryland Baltimore County, Baltimore, Maryland 21228\u20135398","institution_ids":["https://openalex.org/I79272384"]},{"raw_affiliation_string":"Member, Institute for Advanced Computer Studies, University of Maryland, College Park","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.0429,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76816385,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"24","issue":"3","first_page":"147","last_page":"159"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.801526665687561},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.753752589225769},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6787371635437012},{"id":"https://openalex.org/keywords/subadditivity","display_name":"Subadditivity","score":0.6514137983322144},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5036305785179138},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4738346040248871},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4647952914237976},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.448653906583786},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.4451158940792084},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43950018286705017},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4346499443054199}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.801526665687561},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.753752589225769},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6787371635437012},{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.6514137983322144},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5036305785179138},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4738346040248871},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4647952914237976},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.448653906583786},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4451158940792084},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43950018286705017},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4346499443054199},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230240303","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230240303","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1522020530","https://openalex.org/W1607391500","https://openalex.org/W1975807353","https://openalex.org/W1990488643","https://openalex.org/W1993966762","https://openalex.org/W1996164900","https://openalex.org/W2014068360","https://openalex.org/W2020112047","https://openalex.org/W2024833542","https://openalex.org/W2045286914","https://openalex.org/W2053913299","https://openalex.org/W2060380213","https://openalex.org/W2064086982","https://openalex.org/W2064791171","https://openalex.org/W2064975723","https://openalex.org/W2067651881","https://openalex.org/W2069712919","https://openalex.org/W2080156195","https://openalex.org/W2084224084","https://openalex.org/W2086709935","https://openalex.org/W2088967712","https://openalex.org/W2096527938","https://openalex.org/W2107102056","https://openalex.org/W2116935655","https://openalex.org/W2143037347","https://openalex.org/W2151977393","https://openalex.org/W2163668690","https://openalex.org/W2168570149","https://openalex.org/W2172222998","https://openalex.org/W2752885492","https://openalex.org/W3016146927","https://openalex.org/W3125018083","https://openalex.org/W3148632216","https://openalex.org/W4292159986"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W3184075718","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W1584380088","https://openalex.org/W2995411114"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"Geometric":[2],"Steiner":[3,149,161,313,388,392],"Minimum":[4],"Tree":[5],"problem":[6,338],"(GSMT)":[7],"is":[8,200,254,305,383,409,431],"to":[9,333,364],"connect":[10],"at":[11],"minimum":[12,162,367,393],"cost":[13,146,158],"n":[14,187,256,294,374,412,417,419,434],"given":[15],"points":[16,389],"(called":[17],"terminals":[18,96],")":[19,223,260,267,275,283,301,304,320,326,350,357,382,415,427],"in":[20,107,137,310],"d":[21,57,66,92,113,206,208,238,297],"\u2010dimensional":[22,239],"Euclidean":[23,170],"space.":[24],"We":[25,133,242],"generalize":[26],"a":[27,78,119,160,165,233,366,371],"GSMT":[28,337],"approximation":[29],"partitioning":[30],"algorithm":[31,61,136,154,199,253],"by":[32,152,156,172,226,445],"Koml\u00f3s":[33],"and":[34,37,77,93,248,276,321,330,351,361,376,379,403,428],"Shing":[35],"(KS)":[36],"analyze":[38],"its":[39,140],"performance":[40,141,195],"under":[41],"more":[42],"relaxed":[43],"conditions.":[44],"These":[45],"generalizations":[46],"have":[47],"practical":[48],"applications":[49],"for":[50,63,87,130,390,400],"multilayer":[51],"VLSI":[52],"routing.":[53],"Whereas":[54],"KS":[55],"assumed":[56,73],"=":[58],"2,":[59],"our":[60,84,135,198,252],"works":[62],"any":[64,88,98,108,336,391],"dimension":[65],"\u2a7e":[67],"2.":[68],"Moreover,":[69],"whereas":[70],"their":[71],"analysis":[72,85],"the":[74,95,124,145,148,153,157,176,179,184,191,194,215,229,245,306,311,328,359,384,404,407,429],"rectilinear":[75,405],"norm":[76,89],"uniform":[79],"distribution":[80,181],"of":[81,111,139,144,147,159,182,190,193,197,251,308,339,370,387],"input":[82],"points,":[83],"holds":[86],"on":[90,105,118,168],"R":[91,112,401],"whenever":[94],"are":[97,327,358],"independent":[99],"identically":[100],"distributed":[101],"random":[102],"variables":[103],"taking":[104],"values":[106],"bounded":[109],"subset":[110],".":[114],"Both":[115],"algorithms":[116],"depend":[117],"parameter":[120],"t":[121,204,221,272,274,288,303,319,325,343,381,396,424,426,441],"through":[122],"which":[123],"user":[125],"can":[126],"trade":[127],"off":[128],"time":[129,247,329,360,408],"solution":[131],"quality.":[132],"evaluate":[134],"terms":[138],"ratio\u2013the":[142],"ratio":[143,196],"tree":[150,369,394],"computed":[151],"divided":[155],"tree.":[163,314],"Applying":[164],"probability":[166],"theorem":[167],"subadditive":[169],"functionals":[171],"Steele,":[173],"we":[174,231],"prove":[175,232,243],"following:":[177],"Under":[178],"aforementioned":[180],"inputs,":[183],"limit":[185],"as":[186],"\u2192":[188],"\u221e":[189],"supremum":[192],"1":[201,217],"+":[202,218,261,268,284,295,416,420,437],"O":[203,219,410,432],"\u22121/":[205],"(":[207,220,258,264,271,280,287,299,318,324,347,354,411,423,433,440],"\u20101),":[209],"almost":[210],"surely.":[211],"This":[212],"result":[213],"generalizes":[214],"corresponding":[216],"\u22121/2":[222],"bound":[224],"proven":[225],"KS.":[227],"Along":[228],"way,":[230],"useful":[234],"combinatorial":[235],"lemma":[236],"about":[237],"rectangle":[240],"slicings.":[241],"that":[244],"worst\u2010case":[246],"space":[249,331,362,430],"complexity":[250],"\u03b8(":[255,277],"lg":[257,435],"n/t":[259,300,414],"T":[262,316,345],"MST":[263,279,346,353],"v,":[265,281],"v":[266,282,292],"nT":[269,421],"SMT":[270,286,317,323,422,439],")/":[273,425],"S":[278,285,322,352,438],")),":[289],"respectively,":[290],"where":[291],"\u2a7d":[293],"2":[296,402],"+1":[298],"\u03c3(":[302,380],"number":[307,386],"vertices":[309],"resulting":[312],"Here,":[315],"required":[332,363],"solve":[334],"exactly":[335],"size":[340],"less":[341],"than":[342],";":[344],"n,":[348,355],"m":[349,356,377],"find":[365],"spanning":[368],"graph":[372],"with":[373,395],"nodes":[375],"edges;":[378],"maximum":[385],"terminals.":[397],"For":[398],"example,":[399],"norm,":[406],"lg(":[413],"lg*":[418],"*n":[436],")).":[442],"\u00a9":[443],"1994":[444],"John":[446],"Wiley":[447],"&amp;":[448],"Sons,":[449],"Inc.":[450]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}