On the maximum uniquely restricted matching for bipartite graphs

Electronic Notes in Discrete Mathematics

Volumn 37, Issue C, 2011, Pages 345-350

  Mishra, Sounaka ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Approximation algorithms; Graph Theory; Matchings; Uniquely restricted matchings

Indexed keywords

EID: 80053057723     PISSN: None     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2011.05.059     Document Type: Article

References (8)

1. Elbassioni, K., R. Raman, S. Ray and R. Sitters, On the approximability of the maximum feasible subsystem problem with 0/1-coefficients, Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA (2009), 1210-1219.
2. Golumbic M.C., Hirst T., Lewenstein M. Uniquely restricted matchings. Algorithmica 2001, 31:139-154.
3. Håstad J. Clique is hard to approximate within n1-∈. Acta Mathematica 1999, 182:105-142.
4. Haldórsson M.M. Approximations of weighted independent set and hereditary subset problems. Jr. of Graph Algorithms and Applications 2000, 4:1-16.
5. Hershkowitz D., Schnider H. Ranks of zero patterns and sign patterns. Linear and Multilinear Algebra 1993, 34:3-19.
6. Papadimitriou C.H. Computational Complexity 1994, Addison Wesley.
7. Papadimitriou C.H., Yannakakis M. Optimization, Approximation, and Complexity Classes. J. Comput. System Sci. 1991, 43:425-440.
8. Yannakakis M., Gavril F. Edge dominating sets in graphs. SIAM J. Appl. Math. 1980, 38:364-372.