{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:24:56Z","timestamp":1743009896447,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030484385"},{"type":"electronic","value":"9783030484392"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-48439-2_40","type":"book-chapter","created":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T15:04:52Z","timestamp":1600959892000},"page":"331-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes"],"prefix":"10.1007","author":[{"given":"Frank","family":"Gurski","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Hoffmann","sequence":"additional","affiliation":[]},{"given":"Dominique","family":"Komander","sequence":"additional","affiliation":[]},{"given":"Carolin","family":"Rehs","sequence":"additional","affiliation":[]},{"given":"Jochen","family":"Rethmann","sequence":"additional","affiliation":[]},{"given":"Egon","family":"Wanke","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,25]]},"reference":[{"issue":"1","key":"40_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00454-013-9550-9","volume":"51","author":"AK Abu-Affash","year":"2014","unstructured":"Abu-Affash, A.K., Carmi, P., Katz, M.J., Segal, M.: The Euclidean bottleneck Steiner path problem and other applications of (\u03b1,\u03b2)-pair decomposition. Discrete Comput. Geom. 51(1), 1\u201323 (2014)","journal-title":"Discrete Comput. Geom."},{"key":"40_CR2","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.ic.2014.12.008","volume":"243","author":"H Bodlaender","year":"2015","unstructured":"Bodlaender, H., Cygan, M., Kratsch, S., Nederlof, J.: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Inf. Comput. 243, 86\u2013111 (2015)","journal-title":"Inf. Comput."},{"key":"40_CR3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D Corneil","year":"1981","unstructured":"Corneil, D., Lerchs, H., Stewart-Burlingham, L.: Complement reducible graphs. Discrete Appl. Math. 3, 163\u2013174 (1981)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"40_CR4","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D Corneil","year":"1985","unstructured":"Corneil, D., Perl, Y., Stewart, L.: A linear recognition algorithm for cographs. SIAM J. Comput. 14(4), 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"issue":"12","key":"40_CR5","doi-asserted-by":"crossref","first-page":"1722","DOI":"10.1016\/j.dam.2006.03.005","volume":"154","author":"C Crespelle","year":"2006","unstructured":"Crespelle, C., Paul, C.: Fully dynamic recognition algorithm and certificate for directed cographs. Discrete Appl. Math. 154(12), 1722\u20131741 (2006)","journal-title":"Discrete Appl. Math."},{"key":"40_CR6","unstructured":"Custic, A., Lendl, S.: On streaming algorithms for the Steiner cycle and path cover problem on interval graphs and falling platforms in video games. ACM Comput. Res. Repository abs\/1802.08577, 9 pp. (2018)"},{"issue":"5","key":"40_CR7","first-page":"11","volume":"76","author":"SS Moharana","year":"2013","unstructured":"Moharana, S.S., Joshi, A., Vijay, S.: Steiner path for trees. Int. J. Comput. Appl. 76(5), 11\u201314 (2013)","journal-title":"Int. J. Comput. Appl."},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Reich, G., Widmayer, P.: Beyond Steiner\u2019s problem: a VLSI oriented generalization. In: Proceedings of Graph-Theoretical Concepts in Computer Science (WG). Lecture Notes in Computer Science, vol. 411, pp. 196\u2013210. Springer, Berlin (1990)","DOI":"10.1007\/3-540-52292-1_14"},{"key":"40_CR9","unstructured":"Wald, J., Colbourn, C.: Steiner trees in outerplanar graphs. In: Thirteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, pp. 15\u201322 (1982)"},{"key":"40_CR10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230130202","volume":"13","author":"J Wald","year":"1983","unstructured":"Wald, J., Colbourn, C.: Steiner trees, partial 2-trees, and minimum IFI networks. Networks 13, 159\u2013167 (1983)","journal-title":"Networks"},{"key":"40_CR11","unstructured":"Westbrook, J., Yan, D.: Approximation algorithms for the class Steiner tree problem (1995). Research Report"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48439-2_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T15:13:25Z","timestamp":1600960405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-48439-2_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030484385","9783030484392"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48439-2_40","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}