{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:23Z","timestamp":1725664523786},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613329"},{"type":"electronic","value":"9783540684619"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61332-3_135","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:33:58Z","timestamp":1330292038000},"page":"21-30","source":"Crossref","is-referenced-by-count":1,"title":["Steiner problems on directed acyclic graphs"],"prefix":"10.1007","author":[{"given":"Tsan-sheng","family":"Hsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ku-Hui","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Da-Wei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. T.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.3230100207","volume":"10","author":"Y. P. Aneja","year":"1980","unstructured":"Y. P. Aneja. An integer linear programming approach to the Steiner problem in graphs. Networks, 10:167\u2013178, 1980.","journal-title":"Networks"},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0166-218X(93)90086-4","volume":"47","author":"G. Dahl","year":"1993","unstructured":"G. Dahl. Directed Steiner problems with connectivity constraints. Discrete Applied Math., 47:109\u2013128, 1993.","journal-title":"Discrete Applied Math."},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S. E. Dreyfus","year":"1972","unstructured":"S. E. Dreyfus and R. A. Wagner. The Steiner problem in graphs. Networks, 1:195\u2013207, 1972.","journal-title":"Networks"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. L. Fredman","year":"1987","unstructured":"M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM, 34(3):596\u2013615, 1987.","journal-title":"Journal of the ACM"},{"issue":"2","key":"3_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579168","volume":"6","author":"H. N. Gabow","year":"1986","unstructured":"H. N. Gabow, Z. Galil, T. Spencer, and R. E. Tarjan. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs. Combinatorica, 6(2):109\u2013122, 1986.","journal-title":"Combinatorica"},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230010203","volume":"1","author":"S. L. Hakimi","year":"1971","unstructured":"S. L. Hakimi. Steiner's problem in graphs and its applications. Networks, 1:113\u2013133, 1971.","journal-title":"Networks"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.3230220105","volume":"22","author":"F. K. Hwang","year":"1992","unstructured":"F. K. Hwang and D. S. Richards. Steiner tree problems. Networks, 22:55\u201389, 1992.","journal-title":"Networks"},{"key":"3_CR8","unstructured":"F. K. Hwang, D. S. Richards, and P. Winter. The Steiner Tree Problem. Annals of Discrete mathematics 53. North-Holland, 1992."},{"key":"3_CR9","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. L. Lawler","year":"1976","unstructured":"E. L. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart, and Winston, New York, 1976."},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/net.3230120202","volume":"12","author":"S. Martello","year":"1982","unstructured":"S. Martello and P. Toth. Finding a minimum equivalent graph of a digraph. Networks, 12:89\u2013100, 1982.","journal-title":"Networks"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"L. Nastansky, S. M. Selkow, and N. F. Stewart. Cost-minimal trees in directed acyclic graphs. Zeitschrift f\u00fcr Operations Research, pages 59\u201367, 1974.","DOI":"10.1007\/BF01949715"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"S. K. Rao, P. Sadayappan, F. K. Hwang, and P. W. Shor. The rectilinear Steiner arborescence problem. Algorithmica, pages 277\u2013288, 1992.","DOI":"10.1007\/BF01758762"},{"key":"3_CR13","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R. E. Tarjan","year":"1983","unstructured":"R. E. Tarjan. Data Structures and Network Algorithms. SIAM Press, Philadelphia, PA, 1983."},{"key":"3_CR14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0020-0190(93)90185-C","volume":"48","author":"S. Voss","year":"1993","unstructured":"S. Voss. Worst-case performance of some heuristics for Steiner's problem in directed graphs. Information Processing Letters, 48:99\u2013105, 1993.","journal-title":"Information Processing Letters"},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P. Winter","year":"1987","unstructured":"P. Winter. Steiner problem in networks: A survey. Networks, 17:129\u2013167, 1987.","journal-title":"Networks"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02612335","volume":"28","author":"R. T. Wong","year":"1984","unstructured":"R. T. Wong. A dual ascent approach for Steiner tree problems on a directed graphs. Math. Programming, 28:271\u2013287, 1984.","journal-title":"Math. Programming"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61332-3_135.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:05:30Z","timestamp":1605647130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61332-3_135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613329","9783540684619"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-61332-3_135","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}