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

Author： Henzinger M.R.  

Publisher： Academic Press

ISSN： 0196-6774

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

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

Abstract

Related content

On restricted edge-connectivity of vertex-transitive multigraphs

By Tian Yingzhi   Meng Jixiang  

International Journal of Computer Mathematics, Vol. 91, Iss. 8, 2014-08 ,pp. : 1655-1661

Taylor & Francis Ltd

Access to resources Recommend Favorite

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

By Li Yuchao   Tu Jianhua  

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

Taylor & Francis Ltd

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

Improved Approximation Algorithms for Uniform Connectivity Problems

By Khuller S.   Raghavachari B.  

Journal of Algorithms, Vol. 21, Iss. 2, 1996-09 ,pp. : 434-450

Academic Press

Access to resources Recommend Favorite

On the vertex connectivity of a relation in an association scheme

By Evdokimov S.   Ponomarenko I.  

Journal of Mathematical Sciences, Vol. 134, Iss. 5, 2006-05 ,pp. : 2354-2357

Springer Publishing Company

Access to resources Recommend Favorite