{"id":"https://openalex.org/W1993251782","doi":"https://doi.org/10.1002/net.3230240802","title":"Experimental evaluation of a partitioning algorithm for the steiner tree problem in <i>R</i><sup>2</sup> and <i>R</i><sup>3</sup>","display_name":"Experimental evaluation of a partitioning algorithm for the steiner tree problem in <i>R</i><sup>2</sup> and <i>R</i><sup>3</sup>","publication_year":1994,"publication_date":"1994-12-01","ids":{"openalex":"https://openalex.org/W1993251782","doi":"https://doi.org/10.1002/net.3230240802","mag":"1993251782"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230240802","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230240802","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/A5110298702","display_name":"Sivakumar Ravada","orcid":null},"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":true,"raw_author_name":"Sivakumar Ravada","raw_affiliation_strings":["Computer Science Department, University of Maryland Baltimore County, Baltimore, Maryland 21228-5398","Computer Science Department, University of Maryland Baltimore County, Baltimore, Maryland 21228\u20135398"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Maryland Baltimore County, Baltimore, Maryland 21228-5398","institution_ids":["https://openalex.org/I79272384"]},{"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/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-5398","Computer Science Department, University of Maryland Baltimore County, Baltimore, Maryland 21228\u20135398"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Maryland Baltimore County, Baltimore, Maryland 21228-5398","institution_ids":["https://openalex.org/I79272384"]},{"raw_affiliation_string":"Computer Science Department, University of Maryland Baltimore County, Baltimore, Maryland 21228\u20135398","institution_ids":["https://openalex.org/I79272384"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110298702"],"corresponding_institution_ids":["https://openalex.org/I79272384"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.5209,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.63624473,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"24","issue":"8","first_page":"409","last_page":"415"},"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.9983999729156494,"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.9965999722480774,"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.7377530336380005},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6593805551528931},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5602350234985352},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49325770139694214},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4726996421813965},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4538222551345825},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41765648126602173},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.41360345482826233},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.4111577272415161},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3376997113227844},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32657232880592346},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2418609857559204}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.7377530336380005},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6593805551528931},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5602350234985352},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49325770139694214},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4726996421813965},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4538222551345825},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41765648126602173},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.41360345482826233},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.4111577272415161},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3376997113227844},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32657232880592346},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2418609857559204},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230240802","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230240802","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":[{"id":"https://metadata.un.org/sdg/9","score":0.4300000071525574,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320309636","display_name":"University of Minnesota","ror":"https://ror.org/03grvy078"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1975807353","https://openalex.org/W1990488643","https://openalex.org/W2022150791","https://openalex.org/W2045286914","https://openalex.org/W2070582626","https://openalex.org/W2080156195","https://openalex.org/W2088967712","https://openalex.org/W2096527938","https://openalex.org/W2116935655","https://openalex.org/W2172222998","https://openalex.org/W2752885492"],"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/W2995411114","https://openalex.org/W2011703460"],"abstract_inverted_index":{"Abstract":[0],"We":[1,185],"experimentally":[2],"evaluate":[3],"sequential":[4,225,264],"and":[5,15,42,163,204,206,258,320],"distributed":[6,287,326],"implementations":[7,33],"of":[8,118,121,173,177,221,241,245,272,283,303,307],"an":[9,35,78],"approximation":[10],"partitioning":[11,55,75,97,168],"algorithm":[12,76,98,136,169],"by":[13,53,93,202,248,310,340],"Kalpakis":[14,203],"Sherman":[16,205],"for":[17,28,38,112,138,166,170],"the":[18,40,54,74,106,119,131,142,151,160,167,182,188,192,242,304],"Geometric":[19],"Steiner":[20,50,134,237,268,299,332],"Minimum":[21],"Tree":[22],"Problem":[23],"(GSMT)":[24],"in":[25,64,83,150,191,251,313],"R":[26,139],"d":[27,29,152,156,215,277],"=":[30,216,229,256,278,291,318],"2,3.":[31],"Our":[32],"incorporate":[34],"improved":[36],"method":[37],"combining":[39],"subproblems,":[41],"single\u2010and":[43],"double\u2010edge":[44],"reduction":[45],"techniques":[46],"to":[47,66,181],"eliminate":[48],"unnecessary":[49],"points":[51],"created":[52],"process.":[56],"Results":[57],"show":[58],"that":[59,176,208,246,308],"these":[60,72],"refinements":[61],"are":[62],"crucial":[63],"practice":[65],"produce":[67],"high\u2010quality":[68],"results.":[69],"Moreover,":[70],"with":[71,90,227,276,289],"refinements,":[73],"is":[77,210],"effective":[79],"practical":[80],"heuristic,":[81],"which":[82,105],"less":[84,211],"time":[85,111,162],"finds":[86],"solutions":[87],"roughly":[88],"comparable":[89],"those":[91],"computed":[92,247,309],"Smith's":[94,129,178,249,311,336],"Algorithm.":[95,337],"The":[96],"depends":[99],"on":[100,218,280],"a":[101,236,298],"parameter":[102],"t":[103,125,174,228,255,290,317],"through":[104],"user":[107],"can":[108],"trade":[109],"off":[110],"solution":[113,164],"quality.":[114],"To":[115],"solve":[116],"each":[117],"subproblems":[120],"size":[122],"at":[123],"most":[124],",":[126,157],"we":[127,158],"apply":[128],"Algorithm,":[130],"only":[132],"other":[133],"tree":[135,238,300],"known":[137],"3":[140,279],"under":[141],"Euclidean":[143],"norm.":[144],"Using":[145],"uniformly":[146],"generated":[147],"point":[148],"sets":[149,220,282],"\u2010cube":[153],"[0,":[154],"100]":[155],"compare":[159],"running":[161],"quality":[165],"various":[171],"values":[172],"against":[175],"Algorithm":[179,250,312],"applied":[180],"entire":[183],"input.":[184],"also":[186],"estimate":[187],"constant":[189],"factor":[190],"1":[193],"+":[194],"O(t":[195],"\u22121/d(d\u20101)":[196],")":[197],"asymptotic":[198],"performance":[199],"bound":[200],"proven":[201],"find":[207],"it":[209],"than":[212,334],"one.":[213],"With":[214],"2":[217],"input":[219,281],"25":[222],"points,":[223,285],"our":[224,263,286,325],"implementation":[226,265,288,327],"7":[230],"typically":[231,266,293],"found":[232,267,294,329],"within":[233,239,270,295,301],"6":[234],"seconds":[235,297],"1%":[240,302],"cost":[243,305],"(342)":[244],"20":[252],"seconds.":[253,315],"At":[254,316],"13":[257],"using":[259,321],"approximately":[260,322],"15":[261],"seconds,":[262,324],"trees":[269,333],"0.1%":[271],"this":[273],"cost.":[274],"Similarly,":[275],"60":[284],"10":[292],"22":[296],"(1059)":[306],"200":[314],"31":[319],"108":[323],"usually":[328],"slightly":[330],"better":[331],"did":[335],"\u00a9":[338],"1994":[339],"John":[341],"Wiley":[342],"&amp;":[343],"Sons,":[344],"Inc.":[345]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}