{"id":"https://openalex.org/W2145405976","doi":"https://doi.org/10.1145/1143997.1144184","title":"A tree-based genetic algorithm for building rectilinear Steiner arborescences","display_name":"A tree-based genetic algorithm for building rectilinear Steiner arborescences","publication_year":2006,"publication_date":"2006-07-08","ids":{"openalex":"https://openalex.org/W2145405976","doi":"https://doi.org/10.1145/1143997.1144184","mag":"2145405976"},"language":"en","primary_location":{"id":"doi:10.1145/1143997.1144184","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1143997.1144184","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th annual conference on Genetic and evolutionary computation","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/A5112529144","display_name":"William A. Greene","orcid":null},"institutions":[{"id":"https://openalex.org/I192396691","display_name":"University of New Orleans","ror":"https://ror.org/034mtvk83","country_code":"US","type":"education","lineage":["https://openalex.org/I192396691","https://openalex.org/I2799628689"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"William A. Greene","raw_affiliation_strings":["University of New Orleans, New Orleans, LA"],"affiliations":[{"raw_affiliation_string":"University of New Orleans, New Orleans, LA","institution_ids":["https://openalex.org/I192396691"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5112529144"],"corresponding_institution_ids":["https://openalex.org/I192396691"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.17594261,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"1179","last_page":"1186"},"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.9994000196456909,"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.9994000196456909,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9836999773979187,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.7958074808120728},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6240693926811218},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5127521753311157},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5036274790763855},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.49828314781188965},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48889461159706116},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.46168771386146545},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.45099496841430664},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.44098758697509766},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43734118342399597},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4371919333934784},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39408278465270996},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.23893135786056519},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.18513813614845276},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11879977583885193}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7958074808120728},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6240693926811218},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5127521753311157},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5036274790763855},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.49828314781188965},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48889461159706116},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.46168771386146545},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.45099496841430664},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.44098758697509766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43734118342399597},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4371919333934784},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39408278465270996},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.23893135786056519},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18513813614845276},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11879977583885193},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1143997.1144184","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1143997.1144184","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6100000143051147,"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W21317414","https://openalex.org/W1576818901","https://openalex.org/W1596635411","https://openalex.org/W1673505513","https://openalex.org/W1982442142","https://openalex.org/W1986461212","https://openalex.org/W1988808425","https://openalex.org/W1999666034","https://openalex.org/W2049967755","https://openalex.org/W2079737863","https://openalex.org/W2099047172","https://openalex.org/W2100322482","https://openalex.org/W2112948982","https://openalex.org/W2603178913"],"related_works":["https://openalex.org/W2118320476","https://openalex.org/W2161182859","https://openalex.org/W1503036335","https://openalex.org/W2025658531","https://openalex.org/W4244816249","https://openalex.org/W2347477706","https://openalex.org/W2014162767","https://openalex.org/W2115729582","https://openalex.org/W2809283963","https://openalex.org/W2367260997"],"abstract_inverted_index":{"A":[0,46],"rectilinear":[1],"Steiner":[2],"arborescence":[3],"(RSA)":[4],"is":[5,51,65,77,110],"a":[6,11,75,78],"tree,":[7,79],"whose":[8,28],"nodes":[9,35],"include":[10],"prescribed":[12],"set":[13],"of":[14,23,59,101,115,141],"points,":[15],"termed":[16],"the":[17,20,24,41,55,60,63,87,99,113,139],"vertices,":[18],"in":[19,62,70,112,131],"first":[21],"quadrant":[22],"Cartesian":[25],"plane,":[26],"and":[27,103,126,152],"tree":[29,64],"edges":[30,61],"from":[31,135],"parent":[32],"to":[33,40,80,95,98,148],"child":[34],"must":[36],"head":[37],"either":[38],"straight":[39,44],"right":[42],"or":[43],"above.":[45],"minimal":[47],"RSA":[48,76],"(a":[49],"MRSA)":[50],"one":[52],"for":[53,124],"which":[54,128],"total":[56],"path":[57],"length":[58],"minimal.":[66],"RSAs":[67,134,137],"have":[68,90],"application":[69],"VLSI":[71],"design.":[72],"Curiously,":[73],"although":[74],"our":[81,146,155],"knowledge,":[82],"previous":[83],"genetic":[84,117],"attacks":[85],"on":[86],"MRSA":[88],"problem":[89],"not":[91,161],"used":[92],"tree-based":[93,122],"approaches":[94],"representation,":[96],"nor":[97],"operations":[100],"crossover":[102,125],"mutation.":[104],"We":[105,144],"show":[106],"why":[107],"some":[108],"care":[109],"needed":[111],"choice":[114],"such":[116],"operators.":[118],"Then":[119],"we":[120],"present":[121],"operators":[123],"mutation,":[127],"are":[129,164],"successful":[130],"creating":[132],"true":[133],"source":[136],"without":[138],"need":[140],"repair":[142],"steps.":[143],"compare":[145],"results":[147,162],"two":[149],"earlier":[150,169],"researches,":[151],"find":[153],"that":[154,163],"approach":[156],"gives":[157],"good":[158],"results,":[159],"but":[160],"consistently":[165],"better":[166],"than":[167],"those":[168],"approaches.":[170]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}