Abstract
The constrained minimum vertex cover problem on bipartite graphs (the Min-CVCB problem) is an NP-complete problem. This paper presents a polynomial time approximation algorithm for the problem based on the technique of chain implication. For any given constant ε> 0, if an instance of the Min-CVCB problem has a minimum vertex cover of size (k u , k l ), our algorithm constructs a vertex cover of size \((k_u^*, k_l^*)\), satisfying \(\max \{k_u^*/k_u, k_l^*/k_l\}\leq {1+\varepsilon}\).
This work is supported by the National Natural Science Foundation of China (60433020) and the Program for New Century Excellent Talents in University (NCET-05-0683).
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Blough, D.M.: On the reconfigurable of memory arrays containing clustered faults. In: Proc. 21th Int. Symp. on Fault-Tolerant Computing (FTCS’91), pp. 444–451 (1991)
Blough, D.M., Pelc, A.: Complexity of fault diagnosis in comparison models. IEEE Trans. Comput. 41(3), 318–323 (1992)
Chen, J., Kanj, I.A.: Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. Journal of Computer and System Science 67, 833–847 (2003)
Cormen, T.H., Leiserson, C.E., Rovest, R.L.: Introduction to Algorithms. McGraw-Hill, New York (1992)
Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)
Fernau, H., Niedermeier, R.: An efficient exact algorithm for constraint bipartite vertex cover. J. Algorithms 38, 374–410 (2001)
Hasan, N., Liu, C.L.: Minimum Fault Coverage in Reconfigurable Arrays. In: Proc. 18th Int. Symp. on Fault-Tolerant Computing (FTCS’88), pp. 348–353 (1988)
Hasan, N., Liu, C.L.: Fault covers in reconfigurable PLAs. In: Proc. 20th Int. Symp. on Fault-Tloerant Computing (FTCS’90), pp. 166–173 (1990)
Kuo, S.-Y., Fuchs, W.: Efficient spare allocation for reconfigurable arrays. IEEE Des. Test 4, 24–31 (1987)
Lovasz, L., Plummer, M.D.: Matching Theory. Annals of Discrete Mathematics, vol. 29. North-Holland, Amsterdam (1986)
Low, C.P., Leong, H.W.: A new class of efficient algorithms for reconfiguration of memery arrays. IEEE Trans. Comput. 45(1), 614–618 (1996)
Nilsson, N.J.: Principles of Artificial Intelligence. Tioga Publishing Co., Palo Alto (1980)
Smith, M.D., Mazumder, P.: Generation of minimal vertex cover for row/column allocation in self-repairable arrays. IEEE Trans. Comput. 45, 109–115 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, J., Xu, X., Chen, J. (2007). An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs. In: Cai, JY., Cooper, S.B., Zhu, H. (eds) Theory and Applications of Models of Computation. TAMC 2007. Lecture Notes in Computer Science, vol 4484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72504-6_69
Download citation
DOI: https://doi.org/10.1007/978-3-540-72504-6_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72503-9
Online ISBN: 978-3-540-72504-6
eBook Packages: Computer ScienceComputer Science (R0)