{"id":"https://openalex.org/W2792550928","doi":"https://doi.org/10.1109/ised.2017.8303915","title":"K-nearest neighbour (KNN) approach using SAT based technique for rectilinear steiner tree construction","display_name":"K-nearest neighbour (KNN) approach using SAT based technique for rectilinear steiner tree construction","publication_year":2017,"publication_date":"2017-12-01","ids":{"openalex":"https://openalex.org/W2792550928","doi":"https://doi.org/10.1109/ised.2017.8303915","mag":"2792550928"},"language":"en","primary_location":{"id":"doi:10.1109/ised.2017.8303915","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ised.2017.8303915","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 7th International Symposium on Embedded Computing and System Design (ISED)","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/A5088385381","display_name":"Sudeshna Kundu","orcid":"https://orcid.org/0000-0001-5574-6334"},"institutions":[{"id":"https://openalex.org/I155837530","display_name":"National Institute of Technology Durgapur","ror":"https://ror.org/04ds0jm32","country_code":"IN","type":"education","lineage":["https://openalex.org/I155837530"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Sudeshna Kundu","raw_affiliation_strings":["Department of Computer Science and Engineering, National Institute of Technology, Durgapur, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Institute of Technology, Durgapur, India","institution_ids":["https://openalex.org/I155837530"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103190077","display_name":"Suchismita Roy","orcid":"https://orcid.org/0000-0002-7313-1453"},"institutions":[{"id":"https://openalex.org/I155837530","display_name":"National Institute of Technology Durgapur","ror":"https://ror.org/04ds0jm32","country_code":"IN","type":"education","lineage":["https://openalex.org/I155837530"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Suchismita Roy","raw_affiliation_strings":["Department of Computer Science and Engineering, National Institute of Technology, Durgapur, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Institute of Technology, Durgapur, India","institution_ids":["https://openalex.org/I155837530"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024019557","display_name":"Shyamapada Mukherjee","orcid":"https://orcid.org/0000-0003-0062-9709"},"institutions":[{"id":"https://openalex.org/I151903974","display_name":"National Institute Of Technology Silchar","ror":"https://ror.org/001ws2a36","country_code":"IN","type":"education","lineage":["https://openalex.org/I151903974"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Shyamapada Mukherjee","raw_affiliation_strings":["Department of Computer Science and Engineering, National Institute of Technology, Silchar, India"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, National Institute of Technology, Silchar, India","institution_ids":["https://openalex.org/I151903974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088385381"],"corresponding_institution_ids":["https://openalex.org/I155837530"],"apc_list":null,"apc_paid":null,"fwci":0.43,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.67382581,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":1.0,"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":1.0,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9984999895095825,"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.9927999973297119,"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/nearest-neighbour","display_name":"Nearest neighbour","score":0.7943446040153503},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6958134174346924},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5861182808876038},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.513608455657959},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45560023188591003},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4252711832523346},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.42006003856658936},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35669785737991333},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3048052191734314},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23221492767333984}],"concepts":[{"id":"https://openalex.org/C2983946233","wikidata":"https://www.wikidata.org/wiki/Q4088109","display_name":"Nearest neighbour","level":2,"score":0.7943446040153503},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6958134174346924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5861182808876038},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.513608455657959},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45560023188591003},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4252711832523346},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.42006003856658936},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35669785737991333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3048052191734314},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23221492767333984}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ised.2017.8303915","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ised.2017.8303915","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 7th International Symposium on Embedded Computing and System Design (ISED)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"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":28,"referenced_works":["https://openalex.org/W1824657313","https://openalex.org/W1993698748","https://openalex.org/W2020112047","https://openalex.org/W2049375542","https://openalex.org/W2064086982","https://openalex.org/W2069712919","https://openalex.org/W2071567894","https://openalex.org/W2078144752","https://openalex.org/W2090398718","https://openalex.org/W2095821893","https://openalex.org/W2105361752","https://openalex.org/W2108406823","https://openalex.org/W2122111042","https://openalex.org/W2125831674","https://openalex.org/W2140055763","https://openalex.org/W2149943934","https://openalex.org/W2152816060","https://openalex.org/W2177496713","https://openalex.org/W2466549636","https://openalex.org/W2545201814","https://openalex.org/W2603633927","https://openalex.org/W2609144717","https://openalex.org/W3047496068","https://openalex.org/W4232765531","https://openalex.org/W4238998407","https://openalex.org/W6676179522","https://openalex.org/W6719991695","https://openalex.org/W6735698728"],"related_works":["https://openalex.org/W2147397890","https://openalex.org/W2166213322","https://openalex.org/W2155880659","https://openalex.org/W894329006","https://openalex.org/W2622145841","https://openalex.org/W1591806955","https://openalex.org/W2062957446","https://openalex.org/W4206315490","https://openalex.org/W615122461","https://openalex.org/W1483351956"],"abstract_inverted_index":{"The":[0],"Rectilinear":[1],"Steiner":[2],"Minimum":[3],"Tree":[4],"(RSMT)":[5],"problem":[6,37],"claims":[7],"the":[8,19,25,36,44,79,85,104,121,126,133],"minimum":[9],"length":[10],"interconnection":[11],"among":[12],"a":[13,62,96,140],"given":[14],"set":[15],"of":[16,24,57,88],"terminals":[17],"within":[18],"rectilinear":[20],"plane,":[21],"is":[22,66,99,116],"one":[23],"basic":[26],"problems":[27],"in":[28,33],"physical":[29],"design":[30],"automation,":[31],"specifically":[32],"routing.":[34],"Recently,":[35],"has":[38],"drawn":[39],"great":[40],"attention":[41],"due":[42],"to":[43,51,102,138],"need":[45],"for":[46,68,71,119],"extremely":[47],"scalable":[48],"algorithms":[49],"able":[50,137],"handle":[52],"nets":[53,73],"with":[54,74,84],"large":[55],"number":[56,87],"terminals.":[58],"In":[59],"this":[60,93],"paper,":[61],"SAT":[63,80],"based":[64,81,110],"methodology":[65],"introduced":[67],"obtaining":[69],"RSMTs":[70],"different":[72],"varying":[75],"net":[76],"degrees.":[77],"But,":[78],"solutions":[82],"degrades":[83],"increasing":[86],"Boolean":[89],"variables.":[90],"To":[91],"overcome":[92],"scalability":[94],"issue,":[95],"divide-and-conquer":[97],"approach":[98,135],"proposed":[100,134],"here":[101,118],"minimize":[103],"solution":[105,122,127],"space.":[106],"A":[107],"k-d":[108],"tree":[109],"nearest":[111],"neighbor":[112],"(NN)":[113],"search":[114],"algorithm":[115],"developed":[117],"reducing":[120],"space":[123],"and":[124,144],"improving":[125],"quality.":[128],"Experimental":[129],"results":[130],"indicates":[131],"that":[132],"are":[136],"obtain":[139],"better":[141],"run":[142],"time":[143],"possess":[145],"lesser":[146],"wirelength.":[147]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}