{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:33:27Z","timestamp":1710347607279},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,10,1]],"date-time":"1995-10-01T00:00:00Z","timestamp":812505600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ZOR - Methods and Models of Operations Research"],"published-print":{"date-parts":[[1995,10]]},"DOI":"10.1007\/bf01432359","type":"journal-article","created":{"date-parts":[[2005,4,11]],"date-time":"2005-04-11T23:46:06Z","timestamp":1113263166000},"page":"255-275","source":"Crossref","is-referenced-by-count":2,"title":["Routing in grid graphs by cutting planes"],"prefix":"10.1007","volume":"41","author":[{"given":"Martin","family":"Gr\ufffdtschel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TCAD.1983.1270040","volume":"CAD-2","author":"M Burstein","year":"1983","unstructured":"Burstein M, Pelavin R (1983) Hierarchical wire routing. IEEE Transactions on Computer-Aided-Design CAD-2:223?234","journal-title":"IEEE Transactions on Computer-Aided-Design"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"684","DOI":"10.1109\/43.3208","volume":"CAD-7","author":"JP Cohoon","year":"1988","unstructured":"Cohoon JP, Heck PL (1988) BEAVER: A computational-geometry-based tool for switch-box routing. IEEE Transactions on Computer-Aided-Design CAD-7:684?697","journal-title":"IEEE Transactions on Computer-Aided-Design"},{"key":"CR3","first-page":"47","volume-title":"Paths, Flows, and VLSI-Layout","author":"A Frank","year":"1990","unstructured":"Frank A (1990) Packing paths, circuits, and cuts ? a survey. In: Korte B, Lov\u00e1sz L, Pr\u00f6mel HJ, Schrijver A (eds.) Paths, Flows, and VLSI-Layout. Springer-Verlag Berlin Heidelberg 47?100"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey MR, Johnson DS (1977) The rectilinear Steiner tree problem isN P-complete. SIAM J Appl Math 32:826?834","journal-title":"SIAM J Appl Math"},{"key":"CR5","unstructured":"Gr\u00f6tschel M, Martin A, Weismantel R (1992) Packing Steiner trees: Polyhedral investigations. Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin Preprint SC 92-8"},{"key":"CR6","unstructured":"Gr\u00f6tschel M, Martin A, Weismantel R (1992) Packing Steiner trees: A cutting plane algorithm and computational results. Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin Preprint SC 92-9"},{"key":"CR7","unstructured":"Gr\u00f6tschel M, Martin A, Weismantel R (1993) Packing Steiner trees: Separation algorithms. Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin Preprint SC 93-2"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of Computer Computations. Plenum Press New York 85?103"},{"key":"CR9","first-page":"129","volume-title":"Advances in Computing Research Vol 2. VLSI theory","author":"MR Kramer","year":"1984","unstructured":"Kramer MR, van Leeuwen J (1984) The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits. In: Preparata FP (ed) Advances in Computing Research Vol 2. VLSI theory, Jai Press London, 129?146"},{"key":"CR10","first-page":"165","volume-title":"Paths, Flows, and VLSI-Layout","author":"M Kaufmann","year":"1990","unstructured":"Kaufmann M, Mehlhorn K (1990) Routing problems in grid graphs. In: Korte B, Lov\u00e1sz L, Pr\u00f6mel HJ, Schrijver A (eds) Paths, Flows, and VLSI-Layout. Springer-Verlag Berlin Heidelberg 165?184"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0167-9260(85)90029-X","volume":"3","author":"WK Luk","year":"1985","unstructured":"Luk WK (1985) A greedy switch-box router. Integration 3:129?149","journal-title":"Integration"},{"key":"CR12","volume-title":"PhD Thesis","author":"A Martin","year":"1992","unstructured":"Martin A (1992) Packen von Steinerb\u00e4umen: Polyedrische Studien und Anwendung. PhD Thesis Technische Universit\u00e4t Berlin"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0166-218X(83)90100-2","volume":"6","author":"H Okamura","year":"1983","unstructured":"Okamura H, Seymour PD (1983) Multicommodity flows in graphs. Discrete Applied Mathematics 6:55?62","journal-title":"Discrete Applied Mathematics"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TCAD.1987.1270298","volume":"CAD-6","author":"M Sarrafzadeh","year":"1987","unstructured":"Sarrafzadeh M (1987) Channel-routing problem in the knock-knee mode isN P-complete. IEEE Transactions on Computer-Aided-Design CAD-6:503?506","journal-title":"IEEE Transactions on Computer-Aided-Design"}],"container-title":["ZOR Zeitschrift f\ufffdr Operations Research Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01432359.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01432359\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01432359","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:45:32Z","timestamp":1556819132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01432359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["BF01432359"],"URL":"https:\/\/doi.org\/10.1007\/bf01432359","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}