{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T22:38:24Z","timestamp":1725835104219},"publisher-location":"New Delhi","reference-count":10,"publisher":"Springer India","isbn-type":[{"type":"print","value":"9788132226932"},{"type":"electronic","value":"9788132226956"}],"license":[{"start":{"date-parts":[[2015,10,25]],"date-time":"2015-10-25T00:00:00Z","timestamp":1445731200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-81-322-2695-6_56","type":"book-chapter","created":{"date-parts":[[2015,10,25]],"date-time":"2015-10-25T00:41:10Z","timestamp":1445733670000},"page":"657-665","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Multilayer Routing for Incremental Design of an SoC"],"prefix":"10.1007","author":[{"given":"Debasri","family":"Saha","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,25]]},"reference":[{"key":"56_CR1","unstructured":"Kahng, A.B., Robins, G.: A new class of Steiner tree heuristics with good performance: the iterated 1-Steiner approach. In: Proceedings of the International Conference on Computer-Aided Design (1990)"},{"issue":"5","key":"56_CR2","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1109\/TCAD.2003.810747","volume":"22","author":"E Bozorgzadeh","year":"2003","unstructured":"Bozorgzadeh, E., Kastner, R., Sarrafzadeh, M.: Creating and exploiting flexibility in rectilinear Steiner trees. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(5), 605\u2013615 (2003)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"1","key":"56_CR3","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/TCAD.2007.907068","volume":"27","author":"C Chu","year":"2008","unstructured":"Chu, C., Wong, Y.-C.: FLUTE: fast lookup table based rectilinear Steiner minimal tree algorithm for VLSI design. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(1), 70\u201383 (2008)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"56_CR4","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.endm.2009.11.053","volume":"35","author":"MC Dourado","year":"2009","unstructured":"Dourado, M.C., De Oliveira, R.A., Protti, F.: Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals. Electron. Notes Discret. Math. 35, 323\u2013328 (2009)","journal-title":"Electron. Notes Discret. Math."},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"Samanta, T., Ghosal, P., Rahaman, H., Dasgupta, P.S.: A method for the multi-net multi-pin routing problem with layer assignment. In: Proceedings of the International Conference on VLSI Design, pp. 387\u2013392 (2009)","DOI":"10.1109\/VLSI.Design.2009.30"},{"key":"56_CR6","first-page":"451","volume-title":"Lecture Notes in Computer Science","author":"Prasun Ghosal","year":"2012","unstructured":"Ghosal, P., Rahaman, H., Das, S., Das, A., Dasgupta, P.S.: Obstacle aware routing in 3D integrated circuits. In: Proceedings of the Advanced Computing, Networking and Security, LNCS, vol. 7135, pp. 451\u2013460 (2012)"},{"key":"56_CR7","doi-asserted-by":"crossref","unstructured":"Roy, J.A., Markov, I.L.: High performance routing at the nanometer scale. In: Proceedings of the International Conference on Computer-Aided Design, pp. 496\u2013502 (2007)","DOI":"10.1109\/ICCAD.2007.4397313"},{"issue":"9","key":"56_CR8","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1109\/TCAD.2008.927733","volume":"27","author":"T-H Lee","year":"2008","unstructured":"Lee, T.-H., Wang, T.-C.: Congestion-constrained layer assignment for via minimization in global routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 27(9), 1643\u20131656 (2008)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"4","key":"56_CR9","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1109\/TCSII.2005.862041","volume":"53","author":"J Xu","year":"2006","unstructured":"Xu, J., Hong, X., Jing, T., Yang, Y.: Obstacle-avoiding rectilinear minimum-delay Steiner tree construction toward IP-block-based SOC design. IEEE Trans. Circuits Syst. II: Express Briefs 53(4), 309\u2013313 (2006)","journal-title":"IEEE Trans. Circuits Syst. II: Express Briefs"},{"key":"56_CR10","doi-asserted-by":"crossref","unstructured":"Edwards, K., Griffiths, S., Kennedy, W.S.: Partial Interval Set Cover\u2014Trade-Offs Between Scalability and Optimality, Approximation, Randomization and Combinatorial Optimization Algorithms and Techniques, LNCS, vol. 8096, pp. 110\u2013125 (2013)","DOI":"10.1007\/978-3-642-40328-6_9"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the 4th International Conference on Frontiers in Intelligent Computing: Theory and Applications (FICTA) 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-2695-6_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T09:12:06Z","timestamp":1559293926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-81-322-2695-6_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,25]]},"ISBN":["9788132226932","9788132226956"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-2695-6_56","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015,10,25]]}}}