{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T06:14:46Z","timestamp":1738217686857,"version":"3.34.0"},"reference-count":13,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2009,7,1]],"date-time":"2009-07-01T00:00:00Z","timestamp":1246406400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2009,7,1]],"date-time":"2009-07-01T00:00:00Z","timestamp":1246406400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2009,7,1]],"date-time":"2009-07-01T00:00:00Z","timestamp":1246406400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Circuits Syst. II"],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1109\/tcsii.2009.2022203","type":"journal-article","created":{"date-parts":[[2009,5,27]],"date-time":"2009-05-27T15:39:18Z","timestamp":1243438758000},"page":"580-584","source":"Crossref","is-referenced-by-count":5,"title":["A Fully Polynomial-Time Approximation Scheme for Timing-Constrained Minimum Cost Layer Assignment"],"prefix":"10.1109","volume":"56","author":[{"given":"Shiyan","family":"Hu","sequence":"first","affiliation":[{"name":"Dept. of Electr. & Comput. Eng., Michigan Technol. Univ., Houghton, MI, USA"}]},{"given":"Zhuo","family":"Li","sequence":"additional","affiliation":[]},{"given":"Charles J.","family":"Alpert","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.906477"},{"key":"ref11","first-page":"609","article-title":"complexity analysis and speedup techniques for optimal buffer insertion with minimum cost","author":"shi","year":"2004","journal-title":"ASPDAC"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.900712"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/43.365123"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/43.771182"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/4.494206"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/43.905678"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.1.36"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.890096"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/81.481198"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1353629.1353648"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1984.1270074"}],"container-title":["IEEE Transactions on Circuits and Systems II: Express Briefs"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8920\/5165142\/04982748.pdf?arnumber=4982748","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T19:22:52Z","timestamp":1738178572000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/4982748\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7]]},"references-count":13,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tcsii.2009.2022203","relation":{},"ISSN":["1549-7747","1558-3791"],"issn-type":[{"type":"print","value":"1549-7747"},{"type":"electronic","value":"1558-3791"}],"subject":[],"published":{"date-parts":[[2009,7]]}}}