{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:16:39Z","timestamp":1725880599392},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319539249"},{"type":"electronic","value":"9783319539256"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53925-6_30","type":"book-chapter","created":{"date-parts":[[2017,2,19]],"date-time":"2017-02-19T20:12:36Z","timestamp":1487535156000},"page":"385-396","source":"Crossref","is-referenced-by-count":0,"title":["An Approximation Algorithm for Maximum Internal Spanning Tree"],"prefix":"10.1007","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Youta","family":"Harada","sequence":"additional","affiliation":[]},{"given":"Fei","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"issue":"1","key":"30_CR1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s00453-011-9575-5","volume":"65","author":"D Binkele-Raible","year":"2013","unstructured":"Binkele-Raible, D., Fernau, H., Gaspers, S., Liedloff, M.: Exact and parameterized algorithms for max internal spanning tree. Algorithmica 65(1), 95\u2013128 (2013)","journal-title":"Algorithmica"},{"key":"30_CR2","unstructured":"Chen, Z.-Z., Lin, G., Wang, L., Chen, Y.: Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem. CoRR, abs\/1608.03299 (2016)"},{"key":"30_CR3","unstructured":"Hartvigsen, D.: Extensions of matching theory. Ph.D. thesis, Carnegie-Mellon University (1984)"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-642-03367-4_40","volume-title":"Algorithms and Data Structures","author":"M Knauer","year":"2009","unstructured":"Knauer, M., Spoerhase, J.: Better approximation algorithms for the maximum internal spanning tree problem. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 459\u2013470. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-03367-4_40"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-319-13075-0_37","volume-title":"Algorithms and Computation","author":"X Li","year":"2014","unstructured":"Li, X., Zhu, D.: Approximating the maximum internal spanning tree problem via a maximum path-cycle cover. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 467\u2013478. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-13075-0_37"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-319-21840-3_41","volume-title":"Algorithms and Data Structures","author":"W Li","year":"2015","unstructured":"Li, W., Wang, J., Chen, J., Cao, Y.: A 2k-vertex kernel for maximum internal spanning tree. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 495\u2013505. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-21840-3_41"},{"issue":"5","key":"30_CR7","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.ipl.2007.08.030","volume":"105","author":"G Salamon","year":"2008","unstructured":"Salamon, G., Wiener, G.: On finding spanning trees with few leaves. Inf. Process. Lett. 105(5), 164\u2013169 (2008)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53925-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T06:54:19Z","timestamp":1498373659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53925-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539249","9783319539256"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53925-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}