{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:38:25Z","timestamp":1725467905673},"publisher-location":"Berlin\/Heidelberg","reference-count":13,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387968180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040390","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T00:03:50Z","timestamp":1154563430000},"page":"226-236","source":"Crossref","is-referenced-by-count":0,"title":["Channel routing with short wires"],"prefix":"10.1007","author":[{"given":"Michael","family":"Kaufmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis G.","family":"Tollis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"B. Berger, M. Brady, D. Brown, and F. T. Leighton: \u201cNearly Optimal Algorithms and Bounds for Multilayer Channel Routing\u201d. Manuscript."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"B. S. Baker, S. N. Bhatt, and F. T. Leighton: \u201cAn Approximation Algorithm for Manhattan Routing\u201d. Proc. of the 15th Ann. ACM Symposium on Theory of Computing, pp. 477\u2013486 (1983).","DOI":"10.1145\/800061.808779"},{"key":"23_CR3","unstructured":"M. Brady and D. Brown: \u201cVLSI Routing: Four Layers Suffice\u201d. MIT VLSI Conference 1984."},{"key":"23_CR4","unstructured":"D. Brown and F. P. Preparata: \u201cThree-Layer Channel Routing of Multiterminal Nets\u201d. Technical Report, Coordinated Science Lab., University of Illinois at Urbana-Champaign (Oct. 1982)."},{"issue":"4","key":"23_CR5","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF02579432","volume":"2","author":"A. Frank","year":"1982","unstructured":"A. Frank \u201cDisjoint Paths in Rectilinear Grids\u201d Combinatorica, Vol. 2. No. 4, 1982, pp. 361\u2013371","journal-title":"Combinatorica"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"S. Gao and M. Kaufmann: \u201cChannel Routing of Multiterminal Nets\u201d. Proc. of 28th Ann. Symposium on Foundations of Computer Science, pp. 316\u2013325 (1987).","DOI":"10.1109\/SFCS.1987.13"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/0196-6774(86)90016-7","volume":"7","author":"M. Kaufmann","year":"1986","unstructured":"M. Kaufmann and K. Mehlhorn: \u201cRouting through a Generalized Switchbox\u201d. Journal of Algorithms 7, pp. 510\u2013531 (1986).","journal-title":"Journal of Algorithms"},{"issue":"2","key":"23_CR8","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BF01840443","volume":"1","author":"K. Mehlhorn","year":"1986","unstructured":"K. Mehlhorn, F. P. Preparata, and M. Sarrafzadeh: \u201cChannel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs\u201d. Algorithmica 1(2), pp. 213\u2013221, Springer-Verlag (1986).","journal-title":"Algorithmica"},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1109\/TC.1984.1676459","volume":"C-33","author":"F. P. Preparata","year":"1984","unstructured":"F. P. Preparata and W. Lipski: \u201cOptimal Three-Layer Channel Routing\u201d. IEEE Trans. on Computers C-33, pp. 427\u2013437 (1984).","journal-title":"IEEE Trans. on Computers"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"R. L. Rivest, A. Baratz, and G. Miller: \u201cProvably Good Channel Routing Algorithms\u201d. Proc. CMU Conf. on VLSI, pp. 153\u2013159 (Oct. 1981).","DOI":"10.1007\/978-3-642-68402-9_18"},{"key":"23_CR11","unstructured":"M. Sarrafzadeh: \u201cOn the Complexity of the General Channel Routing Problem in the Knock-Knee Mode\u201d. to appear in IEEE Transactions on Computer-Aided Design"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"M. Sarrafzadeh and F. P. Preparata: \u201cCompact Channel Routing of Multiterminal Nets\u201d. Annals of Discrete Math., North Holland (Apr. 1985)","DOI":"10.1016\/S0304-0208(08)73111-6"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"I. G. Tollis: \u201cA New Algorithm for Wiring Layouts\u201d. Proceedings of AWOC, (1988)","DOI":"10.1007\/BFb0040393"}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040390.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:40:18Z","timestamp":1607550018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387968180"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0040390","relation":{},"subject":[]}}