{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:42Z","timestamp":1725488982639},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_10","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"90-102","source":"Crossref","is-referenced-by-count":3,"title":["Approximation Algorithms for the Maximum Internal Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"G\u00e1bor","family":"Salamon","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Lu, H.I., Ravi, R.: The power of local optimization: Approximation algorithms for maximum-leaf spanning tree (DRAFT). Technical Report CS-96-05, Department of Computer Science, Brown University, Providence, Rhode Island (1996)"},{"key":"10_CR2","unstructured":"Salamon, G., Wiener, G.: On finding spanning trees with few leaves (submitted 2006)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-68530-8_37","volume-title":"Algorithms - ESA \u201998","author":"R. Solis-Oba","year":"1998","unstructured":"Solis-Oba, R.: 2-approximation algorithm for finding a spanning tree with maximum number of leaves. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol.\u00a01461, pp. 441\u2013452. Springer, Heidelberg (1998)"},{"key":"10_CR4","first-page":"855","volume-title":"Polyhedra and efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: 50: Shortest spanning trees. In: Combinatorial optimization. In: Polyhedra and efficiency, vol.\u00a0B, pp. 855\u2013876. Springer, Heidelberg (2003)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1002\/1097-0037(200103)37:2<102::AID-NET5>3.0.CO;2-S","volume":"37","author":"S. Zhang","year":"2001","unstructured":"Zhang, S., Wang, Z.: Scattering number in graphs. Networks\u00a037, 102\u2013106 (2001)","journal-title":"Networks"},{"key":"10_CR6","unstructured":"Salamon, G., Wiener, G.: Leaves of spanning trees and vulnerability. In: The 5th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, pp. 225\u2013235 (2007)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:28:34Z","timestamp":1619519314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}