{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T21:31:01Z","timestamp":1676583061293},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,6,3]],"date-time":"2008-06-03T00:00:00Z","timestamp":1212451200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s10107-008-0231-z","type":"journal-article","created":{"date-parts":[[2008,6,2]],"date-time":"2008-06-02T12:29:49Z","timestamp":1212409789000},"page":"201-220","source":"Crossref","is-referenced-by-count":4,"title":["Optimal wire ordering and spacing in low power semiconductor design"],"prefix":"10.1007","volume":"121","author":[{"given":"Peter","family":"Gritzmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Ritter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Zuber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,6,3]]},"reference":[{"issue":"3","key":"231_CR1","first-page":"273","volume":"6","author":"R.E. Burkard","year":"1990","unstructured":"Burkard R.E.: Special cases of travelling salesman problems and heuristics. Acta Mathematicae Applicatae Sinica (English Series) 6(3), 273\u2013288 (1990)","journal-title":"Acta Mathematicae Applicatae Sinica (English Series)"},{"key":"231_CR2","first-page":"125","volume":"82","author":"R.E. Burkard","year":"1998","unstructured":"Burkard R.E., \u00c7ela E., Rote G., Woeginger G.J.: The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases. Math. Program. 82, 125\u2013158 (1998)","journal-title":"Math. Program."},{"issue":"3","key":"231_CR3","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1137\/S0036144596297514","volume":"40","author":"R.E. Burkard","year":"1998","unstructured":"Burkard R.E., Deineko V.G., van Dal R., van der Veen J.A.A., Woeginger G.J.: Well-solvable special cases of the traveling salesman problem: a survey. SIAM Rev. 40(3), 496\u2013546 (1998)","journal-title":"SIAM Rev."},{"key":"231_CR4","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1016\/0038-1101(92)90332-7","volume":"35","author":"Y.L.L. Coz","year":"1992","unstructured":"Coz Y.L.L., Iverson R.B.: A stochastic algorithm for high speed capacitance extraction in integrated circuits. Solid State Electron. 35, 1005\u20131012 (1992)","journal-title":"Solid State Electron."},{"key":"231_CR5","first-page":"87","volume-title":"The Traveling Salesman Problem, A Guided Tour of Combinatorial Optimization, chap. 4","author":"P.C. Gilmore","year":"1985","unstructured":"Gilmore P.C., Lawler E.L., Shmoys D.B.: Well-solved special cases. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds) The Traveling Salesman Problem, A Guided Tour of Combinatorial Optimization, chap. 4, pp. 87\u2013143. Wiley, London (1985)"},{"key":"231_CR6","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/54.41670","volume":"6","author":"P. Groeneveld","year":"1989","unstructured":"Groeneveld P.: Wire ordering for detailed routing. Des. Test Comput. 6, 6\u201317 (1989)","journal-title":"Des. Test Comput."},{"key":"231_CR7","doi-asserted-by":"crossref","unstructured":"Macchiarulo, L., Macii, E., Poncino, M.: Low-energy encoding for deep-submicron address buses. In: Proceedings of the 2001 International Symposium on Low Power Electronics and Design, pp. 176\u2013181 (2001)","DOI":"10.1109\/LPE.2001.945396"},{"key":"231_CR8","unstructured":"Macchiarulo, L., Macii, E., Poncino, M.: Wire placement for crosstalk energy minimization in address buses. In: Proceedings of the Design, Automation and Test in Europe Conference and Exhibition, 2002, pp. 158\u2013162 (2002)"},{"key":"231_CR9","doi-asserted-by":"crossref","unstructured":"Macii, E., Poncino, M., Salerno, S.: Combining wire swapping and spacing for low-power deep-submicron buses. In: Proceedings of the 13th ACM Great Lakes Symposium on VLSI, pp. 198\u2013202 (2003)","DOI":"10.1145\/764808.764859"},{"issue":"5","key":"231_CR10","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1109\/TCSI.2006.869902","volume":"53","author":"S. Michaely","year":"2006","unstructured":"Michaely S., Moiseev K., Kolodny A.: Optimal bus sizing in migration of processor design. IEEE Trans Circuits Syst Part 1 Regular Papers 53(5), 1089\u20131100 (2006)","journal-title":"IEEE Trans Circuits Syst Part 1 Regular Papers"},{"key":"231_CR11","doi-asserted-by":"crossref","unstructured":"Moiseev, K., Wimer, S., Kolodny, A.: Timing optimization of interconnect by simultaneous net-ordering, wire sizing and spacing. In: Proceedings of the IEEE International Symposium on Circuits and Systems, pp. 329\u2013332 (2006)","DOI":"10.1109\/ISCAS.2006.1692589"},{"key":"231_CR12","unstructured":"Semiconductor Industry Association: International Technology Roadmap for Semiconductors (ITRS): 2005 Edition (2005). URL http:\/\/www.itrs.net\/Links\/2005ITRS\/Home2005.htm"},{"key":"231_CR13","doi-asserted-by":"crossref","first-page":"179","DOI":"10.2307\/1970124","volume":"66","author":"F. Supnick","year":"1957","unstructured":"Supnick F.: Extreme Hamiltonian lines. Ann. Math. 66, 179\u2013201 (1957)","journal-title":"Ann. Math."},{"key":"231_CR14","first-page":"308","volume-title":"Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 3064","author":"J. Vygen","year":"2004","unstructured":"Vygen J.: Near-optimum global routing with coupling, delay bounds, and power consumption. In: Bienstock, D., Nemhauser, G. (eds) Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 3064, pp. 308\u2013324. Springer, Heidelberg (2004)"},{"key":"231_CR15","first-page":"55","volume-title":"Integrated Circuit Design, Power and Timing Modeling, Optimization and Simulation, Lecture Notes in Computer Science, vol. 2451","author":"A. Windschiegl","year":"2002","unstructured":"Windschiegl A., Zuber P., Stechele W.: Exploiting metal layer characteristics for low-power routing. In: Hochet, B., Acosta, A.J., Bellido, M.J. (eds) Integrated Circuit Design, Power and Timing Modeling, Optimization and Simulation, Lecture Notes in Computer Science, vol. 2451, pp. 55\u201364. Springer, Heidelberg (2002)"},{"issue":"2","key":"231_CR16","first-page":"140","volume":"5\/4","author":"G.J. Woeginger","year":"2003","unstructured":"Woeginger G.J.: Computational problems without computation. Nieuw Archief voor Wiskunde 5\/4(2), 140\u2013147 (2003)","journal-title":"Nieuw Archief voor Wiskunde"},{"key":"231_CR17","doi-asserted-by":"crossref","unstructured":"Yim, J., Kyung, C.: Reducing cross-coupling among interconnect wires in deep-submicron datapath design. In: Proceedings of the 36th ACM\/IEEE Conference on Design automation, pp. 485\u2013490 (1999)","DOI":"10.1145\/309847.309984"},{"key":"231_CR18","unstructured":"Zuber, P.: Wire topology optimisation for low power CMOS. Ph.D. thesis, TU M\u00fcnchen (2007). URL http:\/\/nbn-resolving.de\/urn\/resolver.pl?urn:nbn:de:bvb:91-dis s-20070802-618152-1-6"},{"key":"231_CR19","doi-asserted-by":"crossref","unstructured":"Zuber, P., Gritzmann, P., Ritter, M., Stechele, W.: The optimal wire order for low power CMOS. In: Integrated Circuit and System Design, Lecture Notes in Computer Science, vol. 3728, pp. 664\u2013683. Springer, Heidelberg (2005)","DOI":"10.1007\/11556930_69"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0231-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-008-0231-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0231-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:05Z","timestamp":1559123405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-008-0231-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,3]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["231"],"URL":"https:\/\/doi.org\/10.1007\/s10107-008-0231-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,3]]}}}