{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:27:04Z","timestamp":1773656824271,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T00:00:00Z","timestamp":1307664000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s11590-011-0351-x","type":"journal-article","created":{"date-parts":[[2011,6,9]],"date-time":"2011-06-09T08:50:43Z","timestamp":1307609443000},"page":"1161-1171","source":"Crossref","is-referenced-by-count":11,"title":["Integer programming formulations for the minimum weighted maximal matching problem"],"prefix":"10.1007","volume":"6","author":[{"given":"Z. Caner","family":"Ta\u015fk\u0131n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T\u0131naz","family":"Ekim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,10]]},"reference":[{"key":"351_CR1","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.tcs.2007.06.009","volume":"385","author":"A. Berger","year":"2007","unstructured":"Berger A., Fukunaga T., Nagamochi H., Parekh O.: Approximability of the capacitated b-edge dominating set problem. Theor. Comput. Sci. 385, 202\u2013213 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"351_CR2","volume-title":"Handbook of Combinatorial Optimization","author":"I.M. Bomze","year":"1999","unstructured":"Bomze I.M., Budinich M., Pardalos P.M., Pelillo M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds) Handbook of Combinatorial Optimization, Kluwer, Dordrecht (1999)"},{"key":"351_CR3","doi-asserted-by":"crossref","unstructured":"Cardinal, J., Labb\u00e9, M., Langerman, S., Levy, E., M\u00e9lot, H.: A tight analysis of the maximal matching heuristic. In: COCOON, Lecture Notes in Computer Science, vol. 3595, pp. 701\u2013709 (2005)","DOI":"10.1007\/11533719_71"},{"key":"351_CR4","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1016\/j.tcs.2008.12.036","volume":"410","author":"J. Cardinal","year":"2009","unstructured":"Cardinal J., Langerman S., Levy E.: Improved approximation bounds for edge dominating set in dense graphs. Theor. Comput. Sci. 410, 949\u2013957 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"351_CR5","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10878-006-7908-0","volume":"11","author":"M. Chleb\u00edk","year":"2006","unstructured":"Chleb\u00edk M., Chleb\u00edkov\u00e1 J.: Approximation hardness of edge dominating set problems. J. Combin. Optim. 11(3), 279\u2013290 (2006)","journal-title":"J. Combin. Optim."},{"key":"351_CR6","doi-asserted-by":"crossref","unstructured":"Demange, M., Ekim, T.: Minimum maximal matching is NP-hard in regular bipartite graphs. In: TAMC 2008, Lecture Notes in Computer Science, vol. 4978, pp. 364\u2013374 (2008)","DOI":"10.1007\/978-3-540-79228-4_32"},{"key":"351_CR7","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds J.: Paths, trees and flowers. Can. J. Math. 17, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"key":"351_CR8","doi-asserted-by":"crossref","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. 118, 199\u2013207 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"351_CR9","doi-asserted-by":"crossref","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. 6(3), 375\u2013387 (1993)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"351_CR10","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 15(1), 51\u201357 (1995)","journal-title":"Discuss. Math. Graph. Theory"},{"key":"351_CR11","unstructured":"Mitchell, S.L., Hedetniemi, S.T.: Edge domination in trees. In: Proceedings of the 8th Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. 489\u2013509. Louisiana State University, Baton Rouge (1977)"},{"issue":"1","key":"351_CR12","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/0377-2217(88)90258-5","volume":"33","author":"M.B. Richey","year":"1988","unstructured":"Richey M.B., Parker R.G.: Minimum-maximal matching in series-parallel graphs. Eur. J. Oper. Res. 33(1), 98\u2013105 (1988)","journal-title":"Eur. J. Oper. Res."},{"key":"351_CR13","doi-asserted-by":"crossref","first-page":"1396","DOI":"10.1287\/mnsc.47.10.1396.10265","volume":"47","author":"H.D. Sherali","year":"2001","unstructured":"Sherali H.D., Smith J.C.: Improving discrete model representations via symmetry considerations. Manag. Sci. 47, 1396\u20131407 (2001)","journal-title":"Manag. Sci."},{"issue":"1","key":"351_CR14","first-page":"271","volume":"22","author":"J. Shi","year":"1997","unstructured":"Shi J., Yamamoto Y.: A global optimization method for minimum maximal flow problem. ACTA Math. Vietnamica 22(1), 271\u2013287 (1997)","journal-title":"ACTA Math. Vietnamica"},{"issue":"3","key":"351_CR15","doi-asserted-by":"crossref","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., Pandu Rangan C., Chang M.-S.: Edge domination on bipartite permutation graphs and cotriangulated graphs. Inf. Process. Lett. 56(3), 165\u2013171 (1995)","journal-title":"Inf. Process. Lett."},{"key":"351_CR16","doi-asserted-by":"crossref","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. 38, 364\u2013372 (1980)","journal-title":"SIAM J. Appl. Math."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0351-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-011-0351-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0351-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T15:07:19Z","timestamp":1560265639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-011-0351-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,10]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["351"],"URL":"https:\/\/doi.org\/10.1007\/s11590-011-0351-x","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,10]]}}}