{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:47:25Z","timestamp":1759063645645},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1007\/bf02057159","type":"journal-article","created":{"date-parts":[[2005,8,12]],"date-time":"2005-08-12T15:19:08Z","timestamp":1123859948000},"page":"481-491","source":"Crossref","is-referenced-by-count":6,"title":["Unconstrained multilayer switchbox routing"],"prefix":"10.1007","volume":"58","author":[{"given":"Endre","family":"Boros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s","family":"Recski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ferenc","family":"Wettl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02057159_CR1","first-page":"245","volume-title":"Advances in Computing Research, Vol. 2:VLSI Theory","author":"M.L. Brady","year":"1984","unstructured":"M.L. Brady and D.J. Brown, VLSI routing: Four layers suffice, in:Advances in Computing Research, Vol. 2:VLSI Theory, ed. F.P. Preparata (JAI Press, Greenwich, CT, 1984) pp. 245\u2013258."},{"key":"BF02057159_CR2","doi-asserted-by":"crossref","unstructured":"M. Forman and F. Wagner, The VLSI layout problem on various embedding models, in:Proc. 16th Int. Workshop on Graph-Theoretic Concepts in Computer Science WG '90, ed. R.H. M\u00f6hring, Lecture Notes in Computer Science 484 (Springer, 1990) pp. 130\u2013139.","DOI":"10.1007\/3-540-53832-1_38"},{"key":"BF02057159_CR3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/TCAD.1985.1270095","volume":"4","author":"S.E. Hambrusch","year":"1985","unstructured":"S.E. Hambrusch, Channel routing in overlap models, IEEE Trans Comp.-Aided Design ICs Syst. CAD-4(1985)23\u201330.","journal-title":"IEEE Trans Comp.-Aided Design ICs Syst."},{"key":"BF02057159_CR4","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0196-6774(84)90045-2","volume":"5","author":"D.S. Johnson","year":"1984","unstructured":"D.S. Johnson, The NP-completeness column: An ongoing guide, J. Algor. 5(1984)147\u2013160.","journal-title":"J. Algor."},{"key":"BF02057159_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T. Lengauer","year":"1990","unstructured":"T. Lengauer,Combinatorial Algorithms for Integrated Circuit Layout (Teubner, Stuttgart-Wiley, Chichester, 1990)."},{"key":"BF02057159_CR6","first-page":"231","volume-title":"Advances in Computing Research, Vol. 2:VLSI Theory","author":"W. Lipski Jr.","year":"1984","unstructured":"W. Lipski, Jr., On the structure of three-layer wirable layouts, in:Advances in Computing Research, Vol. 2:VLSI Theory, ed. F.P. Preparata (JAI Press, Greenwich, CT, 1984) pp. 231\u2013244."},{"key":"BF02057159_CR7","first-page":"83","volume":"130 G 3","author":"M. Marek-Sadowska","year":"1983","unstructured":"M. Marek-Sadowska and E. Kuh, General channel-routing algorithm, Proc. IEE (GB) 130 G 3 (1983) 83\u201388.","journal-title":"Proc. IEE (GB)"},{"key":"BF02057159_CR8","doi-asserted-by":"crossref","unstructured":"H. Mueller and D.A. Mlynski, Automatic multilayer routing for surface mounted technology,Proc. IEEE Int. Symp. Circuits and Systems, Espoo, Finland (1988) pp. 2189\u20132192.","DOI":"10.1109\/ISCAS.1988.15378"},{"key":"BF02057159_CR9","doi-asserted-by":"crossref","unstructured":"A. Recski, Minimax results and polynomial algorithms in VLSI routing, in:Combinatorics, Graphs, Complexity, ed. M. Fiedler and J. Nesetril (Prachatice, 1992) pp. 261\u2013273.","DOI":"10.1016\/S0167-5060(08)70641-1"},{"key":"BF02057159_CR10","unstructured":"A. Recski and F. Strzyzewski, Vertex-disjoint channel routing on two layers, in:Integer Programming and Combinatorial Optimization, ed. R. Kannan and W. Pulleyblank (Waterloo, 1990) pp. 297\u2013405."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02057159.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02057159\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02057159","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T23:11:27Z","timestamp":1586387487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02057159"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":10,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["BF02057159"],"URL":"https:\/\/doi.org\/10.1007\/bf02057159","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}