{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:01:59Z","timestamp":1725562919445},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642151545"},{"type":"electronic","value":"9783642151552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15155-2_41","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T20:17:45Z","timestamp":1281730665000},"page":"465-476","source":"Crossref","is-referenced-by-count":1,"title":["The Prize-Collecting Edge Dominating Set Problem in Trees"],"prefix":"10.1007","author":[{"given":"Naoyuki","family":"Kamiyama","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"41_CR1","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0138030","volume":"38","author":"M. Yannakakis","year":"1980","unstructured":"Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM Journal on Applied Mathematics\u00a038(3), 364\u2013372 (1980)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"41_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-540-93980-1_21","volume-title":"Approximation and Online Algorithms","author":"Z. Gotthilf","year":"2009","unstructured":"Gotthilf, Z., Lewenstein, M., Rainshmidt, E.: A \n                  \n                    \n                  \n                  $(2 - c \\frac{\\log {n}}{n})$\n                 approximation algorithm for the minimum maximal matching problem. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol.\u00a05426, pp. 267\u2013278. Springer, Heidelberg (2009)"},{"key":"41_CR3","unstructured":"Mitchell, S., Hedetniemi, S.: Edge domination in trees. In: Proceedings of the Eighth Southern Conference on Combinatorics, Graph Theory, and Computing, pp. 489\u2013509 (1977)"},{"issue":"3","key":"41_CR4","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0166-218X(00)00383-8","volume":"118","author":"T. Fujito","year":"2002","unstructured":"Fujito, T., Nagamochi, H.: A 2-approximation algorithm for the minimum weight edge dominating set problem. Discrete Applied Mathematics\u00a0118(3), 199\u2013207 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"41_CR5","unstructured":"Parekh, O.: Edge dominating and hypomatchable sets. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 287\u2013291 (2002)"},{"issue":"2","key":"41_CR6","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/s00453-007-9057-y","volume":"50","author":"A. Berger","year":"2008","unstructured":"Berger, A., Parekh, O.: Linear time algorithms for generalized edge dominating set problems. Algorithmica\u00a050(2), 244\u2013254 (2008)","journal-title":"Algorithmica"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Archer, A., Bateni, M., Hajiaghayi, M.T., Karloff, H.J.: Improved approximation algorithms for prize-collecting steiner tree and TSP. In: Proceedings of the Fiftieth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2009), pp. 427\u2013436 (2009)","DOI":"10.1109\/FOCS.2009.39"},{"issue":"2","key":"41_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0377-2217(02)00071-1","volume":"140","author":"D.S. Hochbaum","year":"2002","unstructured":"Hochbaum, D.S.: Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations. European Journal of Operational Research\u00a0140(2), 291\u2013321 (2002)","journal-title":"European Journal of Operational Research"},{"issue":"1-3","key":"41_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.tcs.2008.02.047","volume":"400","author":"O. Parekh","year":"2008","unstructured":"Parekh, O.: Approximation algorithms for partially covering with edges. Theoretical Computer Science\u00a0400(1-3), 159\u2013168 (2008)","journal-title":"Theoretical Computer Science"},{"key":"41_CR10","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. J. Wiley & Sons, Chichester (1986)"},{"key":"41_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J. Edmonds","year":"1977","unstructured":"Edmonds, J., Giles, R.: A min\u2013max relation for submodular functions on graphs. Annals of Discrete Mathematics\u00a01, 185\u2013204 (1977)","journal-title":"Annals of Discrete Mathematics"},{"key":"41_CR12","first-page":"223","volume-title":"Linear Inequalities and Related Systems","author":"A.J. Hoffman","year":"1956","unstructured":"Hoffman, A.J., Kruskal, J.B.: Integral boundary points of convex polyhedra. In: Kuhn, H.W., Tucker, A.W. (eds.) Linear Inequalities and Related Systems, pp. 223\u2013246. Princeton University Press, Princeton (1956)"},{"key":"41_CR13","first-page":"1192","volume":"254","author":"A. Ghouila-Houri","year":"1962","unstructured":"Ghouila-Houri, A.: Caract\u00e9risation des matrices totalement unimodulaires. Comptes Redus Hebdomadaires des S\u00e9ances de l\u2019Acad\u00e9mie des Sciences (Paris)\u00a0254, 1192\u20131194 (1962)","journal-title":"Comptes Redus Hebdomadaires des S\u00e9ances de l\u2019Acad\u00e9mie des Sciences (Paris)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15155-2_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:01:43Z","timestamp":1606186903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15155-2_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151545","9783642151552"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15155-2_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}