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

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.91, Iss.10, 2014-10, pp. : 2103-2108

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity

By Henzinger M.R.

Journal of Algorithms, Vol. 24, Iss. 1, 1997-07 ,pp. : 194-220

Academic Press

Access to resources Recommend Favorite

A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph

By Auletta V. Dinitz Y. Nutov Z. Parente D.

Journal of Algorithms, Vol. 32, Iss. 1, 1999-07 ,pp. : 21-30

Academic Press

Access to resources Recommend Favorite

A Linear Time Algorithm for the Minimum-weight Feedback Vertex Set Problem in Series-parallel Graphs

By Zhang Shao-qiang Li Guo-jun Li Shu-guang

Acta Mathematicae Applicatae Sinica, Vol. 20, Iss. 4, 2004-11 ,pp. : 579-588

Springer Publishing Company

Access to resources Recommend Favorite

An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs

By Mondal Sukumar Pal Madhumangal Pal Tapan K.

International Journal of Computer Mathematics, Vol. 79, Iss. 2, 2002-01 ,pp. : 189-204

Taylor & Francis Ltd

Access to resources Recommend Favorite

The traveling salesman problem on cubic and subcubic graphs

By Boyd Sylvia Sitters René Ster Suzanne Stougie Leen

Mathematical Programming, Vol. 144, Iss. 1-2, 2014-04 ,pp. : 227-245

Elsevier

Access to resources Recommend Favorite