{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T22:34:46Z","timestamp":1697668486436},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1007\/bf01582073","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:37:34Z","timestamp":1114677454000},"page":"281-296","source":"Crossref","is-referenced-by-count":5,"title":["The rectilinear class Steiner tree problem for intervals on two parallel lines"],"prefix":"10.1007","volume":"63","author":[{"given":"Edmund","family":"Ihler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1002\/net.3230200407","volume":"20","author":"P.K. Agarwal","year":"1990","unstructured":"P.K. Agarwal and M.-T. Shing, \u201cAlgorithms for special cases of rectilinear Steiner trees: 1. Points on the boundary of a rectilinear rectangle,\u201dNetworks 20 (1990) 453\u2013485.","journal-title":"Networks"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/net.3230070104","volume":"7","author":"A.V. Aho","year":"1977","unstructured":"A.V. Aho, M.R. Garey and F.K. Hwang, \u201cRectilinear Steiner trees: Efficient special-case algorithms,\u201dNetworks 7 (1977) 37\u201358.","journal-title":"Networks"},{"issue":"4","key":"CR3","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"M.R. Garey","year":"1977","unstructured":"M.R. Garey and D.S. Johnson, \u201cThe rectilinear Steiner tree problem is NP-complete,\u201dSIAM Journal on Applied Mathematics 32(4) (1977) 826\u2013834.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979)."},{"issue":"2","key":"CR5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1137\/0114025","volume":"14","author":"M. Hanan","year":"1966","unstructured":"M. Hanan, \u201cOn Steiner's problem with rectilinear distance,\u201dSIAM Journal on Applied Mathematics 14(2) (1966) 255\u2013265.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/3-540-53832-1_36","volume-title":"Graph-Theoretic Concepts in Computer Science, WG90. Lecture Notes in Computer Science No. 484","author":"E. Ihler","year":"1991","unstructured":"E. Ihler, \u201cBounds on the quality of approximate solutions to the Group Steiner Problem,\u201d in:Graph-Theoretic Concepts in Computer Science, WG90. Lecture Notes in Computer Science No. 484 (Springer, Berlin, 1991) pp. 109\u2013118."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/3-540-55121-2_8","volume-title":"Graph-Theoretic Concepts in Computer Science, WG91. Lecture Notes in Computer Science No. 570","author":"E. Ihler","year":"1992","unstructured":"E. Ihler, \u201cThe complexity of approximating the Class Steiner Tree problem,\u201d in:Graph-Theoretic Concepts in Computer Science, WG91. Lecture Notes in Computer Science No. 570 (Springer, Berlin, 1992) pp. 85\u201396."},{"key":"CR8","first-page":"185","volume-title":"Paths, Flows, and VLSI-Layout","author":"B. Korte","year":"1990","unstructured":"B. Korte, H.J. Pr\u00f6mel and A. Steger, \u201cSteiner trees in VLSI-layout,\u201d in: B. Korte, L. Lov\u00e1sz, H.J. Pr\u00f6mel and A. Schrijver, eds.,Paths, Flows, and VLSI-Layout (Springer, Berlin, 1990) pp. 185\u2013214."},{"key":"CR9","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. (Wiley, New York, 1990)."},{"key":"CR10","unstructured":"T. Ottmann and P. Widmayer,Algorithmen and Datenstrukturen (BI-Wiss.-Verl., 1990)."},{"key":"CR11","volume-title":"\u201cShortest trees for intervals of points in the switchbox,\u201d Technical Report","author":"G. Reich","year":"1991","unstructured":"G. Reich, \u201cShortest trees for intervals of points in the switchbox,\u201d Technical Report, Institut f\u00fcr Informatik, Universit\u00e4t Freiburg (Freiburg, 1991)."},{"key":"CR12","volume-title":"\u201cApproximate minimum spanning trees for vertex classes, Technical Report","author":"G. Reich","year":"1989","unstructured":"G. Reich and P. Widmayer, \u201cApproximate minimum spanning trees for vertex classes, Technical Report, Institut f\u00fcr Informatik, Universit\u00e4t Freiburg (Freiburg, 1989)."},{"key":"CR13","volume-title":"\u201cNew directions in the rectilinear Steiner tree problem, Technical Report","author":"M. Sarrafzadeh","year":"1991","unstructured":"M. Sarrafzadeh and C.K. Wong, \u201cNew directions in the rectilinear Steiner tree problem, Technical Report, Department of Electrical Engineering and Computer Science, Northwestern University (Evanston), and IBM Watson Research Center, Yorktown Heights (New York, 1991)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582073.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582073\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582073","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:46:58Z","timestamp":1586231218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["BF01582073"],"URL":"https:\/\/doi.org\/10.1007\/bf01582073","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}