{"id":"https://openalex.org/W1498759960","doi":"https://doi.org/10.1109/iscas.2006.1692953","title":"A heuristic method for constructing hexagonal Steiner minimal trees for routing in VLSI","display_name":"A heuristic method for constructing hexagonal Steiner minimal trees for routing in VLSI","publication_year":2006,"publication_date":"2006-09-22","ids":{"openalex":"https://openalex.org/W1498759960","doi":"https://doi.org/10.1109/iscas.2006.1692953","mag":"1498759960"},"language":"en","primary_location":{"id":"doi:10.1109/iscas.2006.1692953","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2006.1692953","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Symposium on Circuits and Systems","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/A5027186882","display_name":"Tuhina Samanta","orcid":null},"institutions":[{"id":"https://openalex.org/I98365261","display_name":"Indian Institute of Engineering Science and Technology, Shibpur","ror":"https://ror.org/02ytfzr55","country_code":"IN","type":"education","lineage":["https://openalex.org/I98365261"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"T. Samanta","raw_affiliation_strings":["Bengal Engineering and Science University, Howrah, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bengal Engineering and Science University, Howrah, India","institution_ids":["https://openalex.org/I98365261"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057335067","display_name":"Prasun Ghosal","orcid":"https://orcid.org/0000-0003-4226-9043"},"institutions":[{"id":"https://openalex.org/I98365261","display_name":"Indian Institute of Engineering Science and Technology, Shibpur","ror":"https://ror.org/02ytfzr55","country_code":"IN","type":"education","lineage":["https://openalex.org/I98365261"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"P. Ghosal","raw_affiliation_strings":["Bengal Engineering and Science University, Howrah, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bengal Engineering and Science University, Howrah, India","institution_ids":["https://openalex.org/I98365261"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082934529","display_name":"Hafizur Rahaman","orcid":"https://orcid.org/0000-0001-9012-5437"},"institutions":[{"id":"https://openalex.org/I98365261","display_name":"Indian Institute of Engineering Science and Technology, Shibpur","ror":"https://ror.org/02ytfzr55","country_code":"IN","type":"education","lineage":["https://openalex.org/I98365261"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"H. Rahaman","raw_affiliation_strings":["Bengal Engineering and Science University, Howrah, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bengal Engineering and Science University, Howrah, India","institution_ids":["https://openalex.org/I98365261"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110256937","display_name":"Parthasarathi Dasgupta","orcid":null},"institutions":[{"id":"https://openalex.org/I71495548","display_name":"Indian Institute of Management Calcutta","ror":"https://ror.org/02zhewk16","country_code":"IN","type":"education","lineage":["https://openalex.org/I71495548"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"P. Dasgupta","raw_affiliation_strings":["Indian Institute of Management, Calcutta, Kolkata, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Management, Calcutta, Kolkata, India","institution_ids":["https://openalex.org/I71495548"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5337,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.81915594,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"24","issue":null,"first_page":"4","last_page":"4"},"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.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9976000189781189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/very-large-scale-integration","display_name":"Very-large-scale integration","score":0.7197498083114624},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6287607550621033},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5455989837646484},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5439396500587463},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4697549641132355},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.46757107973098755},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.45963814854621887},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.45589354634284973},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.43329450488090515},{"id":"https://openalex.org/keywords/interconnection","display_name":"Interconnection","score":0.42429083585739136},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4153051972389221},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36351269483566284},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3290480375289917},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.28740614652633667},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2764352560043335},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16428247094154358},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.15871655941009521},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.14518588781356812},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06794646382331848}],"concepts":[{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.7197498083114624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6287607550621033},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5455989837646484},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5439396500587463},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4697549641132355},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.46757107973098755},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.45963814854621887},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.45589354634284973},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.43329450488090515},{"id":"https://openalex.org/C123745756","wikidata":"https://www.wikidata.org/wiki/Q1665949","display_name":"Interconnection","level":2,"score":0.42429083585739136},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4153051972389221},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36351269483566284},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3290480375289917},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.28740614652633667},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2764352560043335},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16428247094154358},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.15871655941009521},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.14518588781356812},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06794646382331848}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscas.2006.1692953","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2006.1692953","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Symposium on Circuits and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1524799784","https://openalex.org/W1545451418","https://openalex.org/W1839838225","https://openalex.org/W2002544351","https://openalex.org/W2011039300","https://openalex.org/W2049967755","https://openalex.org/W2064086982","https://openalex.org/W2080749203","https://openalex.org/W2080879057","https://openalex.org/W2097569130","https://openalex.org/W2108210698","https://openalex.org/W2137962804","https://openalex.org/W2140055763","https://openalex.org/W2167966310","https://openalex.org/W3145128584","https://openalex.org/W4244590348","https://openalex.org/W4245623567","https://openalex.org/W4252732074","https://openalex.org/W6674655842","https://openalex.org/W6684986016"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W2108305519","https://openalex.org/W2068473861","https://openalex.org/W1971663816","https://openalex.org/W3127002380","https://openalex.org/W2369989480","https://openalex.org/W2607223747","https://openalex.org/W2124642421","https://openalex.org/W2361465121","https://openalex.org/W2030786877"],"abstract_inverted_index":{"In":[0,22,91],"deep":[1],"sub-micron":[2],"regime,":[3],"interconnect":[4,27],"delays":[5],"dominate":[6],"VLSI":[7],"circuit":[8],"design.":[9],"Thus,":[10],"construction":[11],"of":[12,56,114],"cost-effective":[13],"global":[14,62],"routing":[15,32,45,75,85,116,141],"trees":[16],"is":[17,47,112],"key":[18],"to":[19,24,72],"such":[20],"designs.":[21],"order":[23],"reduce":[25],"the":[26,39,53,67],"delay,":[28],"traditional":[29],"Manhattan":[30],"(M-)":[31],"architectures":[33],"are":[34],"currently":[35],"being":[36],"replaced":[37],"by":[38,129],"diagonal":[40],"X":[41],"architectures.":[42],"A":[43],"recent":[44],"architecture":[46],"based":[48],"on":[49],"Y":[50],"interconnects,":[51],"involving":[52],"pervasive":[54],"use":[55],"0deg,":[57],"60deg,":[58],"and":[59,63,84,86],"120deg":[60],"oriented":[61],"semi-global":[64],"wirings.":[65],"Unlike":[66],"X-routing,":[68],"Y-routing":[69,98],"Is":[70],"observed":[71],"support":[73],"regular":[74],"grid,":[76],"which":[77,100,121],"as":[78],"important":[79],"for":[80,118,140],"simplifying":[81],"manufacturing":[82],"processes":[83],"design":[87],"rule":[88],"checking":[89],"algorithms.":[90],"this":[92],"paper,":[93],"we":[94],"propose":[95],"a":[96],"novel":[97],"algorithm":[99],"can":[101,136],"solve":[102],"reasonably":[103],"sized":[104],"problems":[105],"in":[106,126],"nominal":[107],"time.":[108],"The":[109],"proposed":[110],"method":[111],"capable":[113],"finding":[115],"solutions":[117],"problem":[119],"instances":[120],"could":[122],"not":[123],"be":[124,137],"solved":[125],"reasonable":[127],"time":[128],"some":[130],"recently":[131],"reported":[132],"methods.":[133],"Moreover,":[134],"it":[135],"easily":[138],"extended":[139],"with":[142],"any":[143],"uniform":[144],"orientation":[145]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}