{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:25:43Z","timestamp":1729617943961,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/iscas.2006.1692953","type":"proceedings-article","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T13:01:13Z","timestamp":1158930073000},"page":"4","source":"Crossref","is-referenced-by-count":11,"title":["A heuristic method for constructing hexagonal Steiner minimal trees for routing in VLSI"],"prefix":"10.1109","author":[{"given":"T.","family":"Samanta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Ghosal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Rahaman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Dasgupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1109\/ICECS.1999.812302","article-title":"Computing Hexagonal Steiner Trees using PCS","author":"thurber","year":"1999","journal-title":"IEEE Int Conf Electronics Circuits Systems"},{"year":"0","author":"edge","key":"17"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/505354.505355"},{"article-title":"Hexagonal Architecture","year":"2002","author":"rostoker","key":"15"},{"article-title":"CAD for Hexagonal Architecture","year":"1998","author":"rostoker","key":"16"},{"key":"13","first-page":"899","article-title":"Routing multiterminal nets in a diagonal model","author":"lodi","year":"0","journal-title":"Proc 1988 Conf Information Sciences and Systems"},{"year":"0","key":"14"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"11"},{"year":"0","key":"12"},{"key":"21","first-page":"1066","article-title":"Spanning Graph-based Nonrectilinear Steiner Tree Algorithms","volume":"24","author":"zhu","year":"2005","journal-title":"IEEE Trans CAD\/ICAS"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1038\/sj\/jors\/0411109"},{"year":"0","key":"20"},{"year":"0","key":"2"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/43.331412"},{"key":"10","first-page":"247","article-title":"The Steiner Minimal Tree Problem in ?-geometry Plane","author":"lee","year":"1996","journal-title":"International Symposium on Algorithms and Computation"},{"journal-title":"Introduction to Algorithm","year":"1989","author":"corinen","key":"7"},{"key":"6","article-title":"The Y-Architecture for On-Chip Interconnect: Analysis and Methodology","author":"chen","year":"2005","journal-title":"IEEE Trans on Computer-Aided Design"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/1119772.1119957"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/764808.764810"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1137\/0114025"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/43.144853"}],"event":{"name":"2006 IEEE International Symposium on Circuits and Systems","acronym":"ISCAS-06","location":"Island of Kos, Greece"},"container-title":["2006 IEEE International Symposium on Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/11145\/35661\/01692953.pdf?arnumber=1692953","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T04:47:49Z","timestamp":1555822069000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1692953\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/iscas.2006.1692953","relation":{},"subject":[]}}