{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:21:13Z","timestamp":1725549673629},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_21","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"233-243","source":"Crossref","is-referenced-by-count":1,"title":["Linear Time Algorithms for Generalized Edge Dominating Set Problems"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"Berger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ojas","family":"Parekh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1023\/A:1011445210568","volume":"5","author":"R. Carr","year":"2001","unstructured":"Carr, R., Fujito, T., Konjevod, G., Parekh, O.: A 2 1\/10-approximation algorithm for a generalization of the weighted edge-dominating set problem. J. Comb. Optim.\u00a05, 317\u2013326 (2001)","journal-title":"J. Comb. Optim."},{"key":"21_CR2","unstructured":"Fricke, G., Laskar, R.: Strong matchings on trees. In: Proceedings of the Twenty-third Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Boca Raton, FL, vol.\u00a089, pp. 239\u2013243 (1992)"},{"issue":"6","key":"21_CR3","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0020-0190(01)00138-7","volume":"79","author":"T. Fujito","year":"2001","unstructured":"Fujito, T.: On approximability of the independent\/connected edge dominating set problems. Inform. Process. Lett.\u00a079(6), 261\u2013266 (2001)","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"21_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 Appl. Math.\u00a0118(3), 199\u2013207 (2002)","journal-title":"Discrete Appl. Math."},{"key":"21_CR5","first-page":"1192","volume":"254","author":"A. Ghouila-Houri","year":"1962","unstructured":"Ghouila-Houri, A.: Caract\u00e9risation des matrices totalement unimodulaires. C. R. Acad. Sci. Paris\u00a0254, 1192\u20131194 (1962)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"21_CR6","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph Theory. Addison-Wesley, Reading (1969)"},{"key":"21_CR7","series-title":"Annals of Mathematics Studies","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: Linear inequalities and related systems. Annals of Mathematics Studies, vol.\u00a038, pp. 223\u2013246. Princeton University Press, Princeton (1956)"},{"issue":"3","key":"21_CR8","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 J. Discrete Math.\u00a06(3), 375\u2013387 (1993)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"21_CR9","doi-asserted-by":"crossref","first-page":"51","DOI":"10.7151\/dmgt.1006","volume":"15","author":"S.F. Hwang","year":"1995","unstructured":"Hwang, S.F., Chang, G.J.: The edge domination problem. Discuss. Math. Graph Theory\u00a015(1), 51\u201357 (1995)","journal-title":"Discuss. Math. Graph Theory"},{"key":"21_CR10","first-page":"489","volume-title":"Proc. of the 8th Southeastern Conference on Combinatorics, Graph Theory and Computing","author":"S.L. Mitchell","year":"1977","unstructured":"Mitchell, S.L., Hedetniemi, S.T.: Edge domination in trees. In: Proc. of the 8th Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. 489\u2013509. Louisiana State Univ., Baton Rouge, La (1977)"},{"issue":"3","key":"21_CR11","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. System Sci.\u00a043(3), 425\u2013440 (1991)","journal-title":"J. Comput. System Sci."},{"key":"21_CR12","first-page":"287","volume-title":"Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Mathematics (SODA 2002)","author":"O. Parekh","year":"2002","unstructured":"Parekh, O.: Edge dominating and hypomatchable sets. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Mathematics (SODA 2002), pp. 287\u2013291. ACM Press, New York (2002)"},{"key":"21_CR13","unstructured":"Parekh, O.: Polyhedral techniques for graphic covering problems. PhD thesis, Carnegie Mellon University (2002)"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-49116-3_24","volume-title":"STACS 99","author":"R. Preis","year":"1999","unstructured":"Preis, R.: Linear time \n                    \n                      \n                    \n                    $\\frac{1}{2}$\n                  -approximation algorithm for maximum weighted matching in general graphs. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 259\u2013269. Springer, Heidelberg (1999)"},{"key":"21_CR15","unstructured":"Schrijver, A.: Combinatorial optimization. Polyhedra and efficiency. In: Algorithms and Combinatorics, vol.\u00a024. Springer, Berlin (2003)"},{"issue":"3","key":"21_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0020-0190(95)94093-8","volume":"56","author":"A. Srinivasan","year":"1995","unstructured":"Srinivasan, A., Madhukar, K., Nagavamsi, P., Rangan, C.P., Chang, M.-S.: Edge domination on bipartite permutation graphs and cotriangulated graphs. Inform. Process. Lett.\u00a056(3), 165\u2013171 (1995)","journal-title":"Inform. Process. Lett."},{"key":"21_CR17","volume-title":"Approximation Algorithms","author":"V. Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer, Heidelberg (2001)"},{"issue":"3","key":"21_CR18","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 J. Appl. Math.\u00a038(3), 364\u2013372 (1980)","journal-title":"SIAM J. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:09:55Z","timestamp":1605643795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11534273_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}