Approximability results for the maximum and minimum maximal induced matching problems

Discrete Optimization

Volumn 5, Issue 3, 2008, Pages 584-593

  Orlovich, Yury ^a   Finke, Gerd ^b   Gordon, Valery ^c   Zverovich, Igor ^d  

^a INSTITUTE OF MATHEMATICS   (Belarus)

^b UNIV GRENOBLE ALPES   (France)

^c UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^d RUTGERS UNIVERSITY   (United States)

Author keywords

Approximability; Bipartite graph; Combinatorial optimization; Induced matching; NP completeness

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

INPUT GRAPH; MAXIMUM INDUCED MATCHING;

GRAPH THEORY;

EID: 43849103922     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2007.11.010     Document Type: Article

References (36)

1. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., and Protasi M. Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties (1999), Springer, Berlin
2. Berge C. Graphs and Hypergraphs (1976), American Elsevier Publishing Company, New York
3. Bondy J.A., and Murty U.S.R. Graph Theory with Applications (1976), American Elsevier Publishing Company, New York
4. Brandstädt A., Le V.B., and Spinrad J.P. Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications (1999), SIAM, Philadelphia, PA
5. Broersma H., Kloks T., Kratsch D., and Müller H. Independent sets in asteroidal triple-free graphs. SIAM J. Discrete Math. 12 (1999) 276-287
6. Cameron K. Induced matchings. Discrete Appl. Math. 24 (1989) 97-102
7. Cameron K. Induced matchings in intersection graphs. Discrete Math. 278 (2004) 1-9
8. Cameron K., Sritharan R., and Tang Y. Finding a maximum induced matching in weakly chordal graphs. Discrete Math. 266 (2003) 133-142
9. Chang J.-M. Induced matchings in asteroidal triple-free graphs. Discrete Appl. Math. 132 (2004) 67-78
10. Chang M.S. Efficient algorithms for the domination problems on interval and circular-arc graphs. SIAM J. Comput. 27 (1998) 1671-1694
11. Chlebík M., and Chlebíková J. Approximation hardness of dominating set problems. Lect. Notes Comput. Sci. 3221 (2004) 192-203
12. Cook S.A. The complexity of theorem proving procedure. Proc. 3rd Ann. ACM Symp. on Theory of Computing (1971), ACM, New York 151-158
13. Duckworth W., Manlove D., and Zito M. On the approximability of the maximum induced matching problem. J. Discrete Algorithms 3 (2005) 79-91
14. Dyer M.E., and Frieze A.M. Planar 3DM is NP-complete. J. Algorithms 7 (1986) 174-184
15. Erdös P. Problems and results in combinatorial analysis and graph theory. Discrete Math. 78 (1988) 81-92
16. Farber M. Independent domination in chordal graphs. Oper. Res. Lett. 1 (1982) 134-138
17. Fricke G., and Laskar R. Strong matchings on trees. Congr. Numer. 89 (1992) 239-243
18. Garey M.R., and Johnson D.S. Computers and Intractability. A Guide to the Theory of NP-completeness (1979), W.H. Freeman and Co., San Francisco, CA
19. Golumbic M.C., and Laskar R. Irredundancy in circular arc graphs. Discrete Appl. Math. 44 (1993) 79-89
20. Golumbic M.C., and Lewenstein M. New results on induced matchings. Discrete Appl. Math. 101 (2000) 157-165
21. Gotthilf Z., and Lewenstein M. Tighter approximations for maximum induced matchings in regular graphs. Lect. Notes Comput. Sci. 3879 (2006) 270-281
22. Harary F., and Holzmann C. Line graphs of bipartite graphs. Rev. Soc. Mat. Chile 1 (1974) 19-20
23. 1 - ε. Acta Math. 182 (1999) 105-142
24. Kirkpatrick D.G., and Hell P. On the complexity of a generalized matching problem. Proc. 10th Ann. ACM Symp. on Theory of Computing (1978), ACM, New York 240-245
25. Kirkpatrick D.G., and Hell P. On the complexity of general graph factor problems. SIAM J. Comput. 12 (1983) 601-609
26. Ko C.W., and Shepherd F.B. Bipartite domination and simultaneous matroid covers. SIAM J. Discrete Math. 16 (2003) 517-523
27. 5-free graphs, and in graphs with matching and induced matching of equal maximum size. Algorithmica 37 (2003) 327-346
28. Liu J., and Zhou H. Maximum induced matchings in graphs. Discrete Math. 170 (1997) 271-281
29. k partition problem and related problems in bipartite graphs. Lect. Notes Comput. Sci. 4362 (2007) 422-433
30. Yu.L. Orlovich, I.E. Zverovich, Maximal induced matchings of minimum/maximum size, DIMACS Technical Report 2004-26, Rutgers University, Rutgers, 2004
31. Yu.L. Orlovich, I.E. Zverovich, Well-matched graphs, RUTCOR Research Report 12-2004, Rutgers University, Rutgers, 2004
32. A.A. McRae, Generalizing NP-completeness proofs for bipartite and chordal graphs, Ph.D. Thesis, Clemson University, Department of Computer Science, 1994
33. Sedláček J. Some properties of interchange graphs. Theory of Graphs and its Applications (1964), Academic Press, New York 145-150
34. Steger A., and Yu M. On induced matchings. Discrete Math. 120 (1993) 291-295
35. Stockmeyer L.J., and Vazirani V.V. NP-completeness of some generalizations of the maximum matching problem. Inform. Process. Lett. 15 (1982) 14-19
36. Zuckerman D. Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput. 3 (2007) 103-138