{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:58:26Z","timestamp":1725551906177},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540311980"},{"type":"electronic","value":"9783540322177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11611257_54","type":"book-chapter","created":{"date-parts":[[2006,1,5]],"date-time":"2006-01-05T11:37:18Z","timestamp":1136461038000},"page":"556-564","source":"Crossref","is-referenced-by-count":1,"title":["Small Independent Edge Dominating Sets in Graphs of Maximum Degree Three"],"prefix":"10.1007","author":[{"given":"Gra\u017cyna","family":"Zwo\u017aniak","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"54_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-24587-2_43","volume-title":"Algorithms and Computation","author":"M. Chleb\u00edk","year":"2003","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 415\u2013424. Springer, Heidelberg (2003)"},{"unstructured":"Duckworth, W., Wormald, N.C.: Linear Programming and the Worst-Case Analysis of Greedy Algorithms on Cubic Graphs (unpublished)","key":"54_CR2"},{"issue":"3","key":"54_CR3","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1137\/0406030","volume":"6","author":"J.D. Horton","year":"1993","unstructured":"Horton, J.D., Kilakos, K.: Minimum Edge Dominating Sets. SIAM Journal on Discrete Mathematics\u00a06(3), 375\u2013387 (1993)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"54_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/3-540-45749-6_60","volume-title":"Algorithms - ESA 2002","author":"K. Lory\u015b","year":"2002","unstructured":"Lory\u015b, K., Zwo\u017aniak, G.: Approximation Algorithm for the Maximum Leaf Spanning Tree Problem for Cubic Graphs. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 686\u2013697. Springer, Heidelberg (2002)"},{"issue":"3","key":"54_CR5","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 Cubic Graphs. SIAM Journal on Applied Mathematics\u00a038(3), 364\u2013372 (1980)","journal-title":"SIAM Journal on Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2006: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11611257_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:09:43Z","timestamp":1619492983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11611257_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540311980","9783540322177"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/11611257_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}