Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 91, 2014 - Issue 10
Submit an article Journal homepage
207
Views
14
CrossRef citations to date
0
Altmetric
Section A

A 2-approximation algorithm for the vertex cover P4 problem in cubic graphs

Yuchao LiSchool of Science, Beijing University of Chemical Technology, Beijing100029, China
&
Jianhua TuSchool of Science, Beijing University of Chemical Technology, Beijing100029, ChinaCorrespondence[email protected]
Pages 2103-2108 | Received 14 May 2010, Accepted 22 Dec 2013, Published online: 26 Mar 2014

References

  • B. Brešar, M. Jakovac, J. Katrenič, G. Semanišin, A. Taranenko, On the vertex k-path cover, Discret. Appl. Math. 161 (2013), pp. 1943–1949. doi: 10.1016/j.dam.2013.02.024
  • B. Brešar, F. Kardoš, J. Katrenič, and G. Semanišin, Minimum k-path vertex cover, Discret. Appl. Math. 159(12) (2001), pp. 1189–1195. doi: 10.1016/j.dam.2011.04.008
  • J.E. Chen, H. Fernau, P. Shaw, J. Wang, and Z.B. Yang, Kernels for packing and covering problems-(extended abstract), The Sixth International Frontiers of Algorithmics Workshop–The Eighth International Conference on Algorithmic Aspects of Information and Management, FAW–AAIM 2012, May 14–16, Peking University, Beijing, China, 2012, pp. 199–211.
  • L.J. Cowen and C.E. Jesurum, Coloring with defects, DIMACS Technical Report, no. 95–25, 1995. Available at http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.31.3510&rep=rep1&type=pdf
  • M.R. Fellows, J. Guo, H. Moser, and R. Niedermeier, A generalization of Nemhauser and Trotter's local optimization theorem, J. Comput. Syst. Sci. 77 (2011), pp. 1141–1158. doi: 10.1016/j.jcss.2010.12.001
  • M.R. Garey, D.S. Johnson, and L.J. Stockmeyer, Some Simplified NP-complete graph problems, Theoret. Comput. Sci. 1 (1976), pp. 237–267. doi: 10.1016/0304-3975(76)90059-1
  • M. Jakovac and A. Taranenko, On the k-path vertex cover of some graph products, Discret. Appl. Math. 313 (2013), pp. 94–100. doi: 10.1016/j.disc.2012.09.010
  • F. Kardoš, J. Katrenič, and I. Schiermeyer, On computing the minimum 3-path vertex cover and dissociation number of graphs, Theoret. Comput. Sci. 412(50) (2011), pp. 7009–7017. doi: 10.1016/j.tcs.2011.09.009
  • L. Lovász, On decompositions of graphs, Studia Sci. Math Hungar. 1 (1966), pp. 237–238.
  • J.H. Tu and F.M. Yang, On the vertex cover P3 problem in cubic graphs, Inform. Process. Lett. 113 (2013), pp. 481–485. doi: 10.1016/j.ipl.2013.04.002
  • J.H. Tu and W.L. Zhou, A primal-dual approximation algorithm for the vertex cover P3 problem, Theoret. Comput. Sci. 412(50) (2011), pp. 7044–7048. doi: 10.1016/j.tcs.2011.09.013
  • J.H. Tu and W.L. Zhou, A factor 2-approximation algorithm for the vertex cover P3 problem, Inf. Process. Lett. 111(14) (2011), pp. 683–686. doi: 10.1016/j.ipl.2011.04.009

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.