{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:21Z","timestamp":1759638381969},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033667"},{"type":"electronic","value":"9783642033674"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03367-4_40","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T07:56:42Z","timestamp":1248076602000},"page":"459-470","source":"Crossref","is-referenced-by-count":12,"title":["Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Martin","family":"Knauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Spoerhase","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"publisher","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. Information Processing Letters\u00a0105, 164\u2013169 (2008)","journal-title":"Information Processing Letters"},{"key":"40_CR2","unstructured":"Lu, H., Ravi, R.: The power of local optimization: approximation algorithms for maximum-leaf spanning tree. Technical report, Department of Computer Science, Brown University (1996)"},{"issue":"12","key":"40_CR3","doi-asserted-by":"publisher","first-page":"2343","DOI":"10.1016\/j.disc.2007.04.071","volume":"308","author":"E. Flandrin","year":"2008","unstructured":"Flandrin, E., Kaiser, T., Kuzel, R., Li, H., Ryjcek, Z.: Neighborhood unions and extremal spanning trees. Discrete Mathematics\u00a0308(12), 2343\u20132350 (2008)","journal-title":"Discrete Mathematics"},{"key":"40_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-540-45078-8_41","volume-title":"Algorithms and Data Structures","author":"E. Prieto","year":"2003","unstructured":"Prieto, E., Sloper, C.: Either\/or: Using vertex cover structure in designing fpt-algorithms - the case of k-internal spanning tree. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol.\u00a02748, pp. 474\u2013483. Springer, Heidelberg (2003)"},{"issue":"3","key":"40_CR5","first-page":"308","volume":"12","author":"E. Prieto","year":"2005","unstructured":"Prieto, E., Sloper, C.: Reducing to independent set structure \u2013 the case of k-internal spanning tree. Nord. J. Comput.\u00a012(3), 308\u2013318 (2005)","journal-title":"Nord. J. Comput."},{"key":"40_CR6","unstructured":"Fernau, H., Raible, D., Gaspers, S., Stepanov, A.A.: Exact exponential time algorithms for max internal spanning tree. In: CoRR (2008) abs\/0811.1875"},{"key":"40_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-540-74456-6_10","volume-title":"Mathematical Foundations of Computer Science 2007","author":"G. Salamon","year":"2007","unstructured":"Salamon, G.: Approximation algorithms for the maximum internal spanning tree problem. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 90\u2013102. Springer, Heidelberg (2007)"},{"issue":"5","key":"40_CR8","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1137\/S0097539703431007","volume":"33","author":"J.B. Orlin","year":"2004","unstructured":"Orlin, J.B., Punnen, A.P., Schulz, A.S.: Approximate local search in combinatorial optimization. SIAM J. Comput.\u00a033(5), 1201\u20131214 (2004)","journal-title":"SIAM J. Comput."},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Salamon, G.: Approximating the maximum internal spanning tree problem. To appear in Theoretical Computer Science (2009)","DOI":"10.1016\/j.tcs.2009.08.029"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03367-4_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T15:28:42Z","timestamp":1558452522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03367-4_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033667","9783642033674"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03367-4_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}