A Better Approximation Algorithm for Finding Planar Subgraphs

Author： Calinescu G.   Fernandes C.G.   Finkler U.   Karloff H.  

Publisher： Academic Press

ISSN： 0196-6774

Source： Journal of Algorithms, Vol.27, Iss.2, 1998-05, pp. : 269-302

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

A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs

By Dinitz Y.   Nutov Z.  

Journal of Algorithms, Vol. 32, Iss. 1, 1999-07 ,pp. : 31-40

Academic Press

Access to resources Recommend Favorite

2-Approximation algorithm for finding a clique with minimum weight of vertices and edges

By Eremin I.   Gimadi E.   Kel’manov A.   Pyatkin A.   Khachai M.  

Proceedings of the Steklov Institute of Mathematics, Vol. 284, Iss. 1, 2014-04 ,pp. : 87-95

MAIK Nauka/Interperiodica

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

Finding 2-edge connected spanning subgraphs

By Huh W.T.  

Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. : 212-216

Elsevier

Access to resources Recommend Favorite

Computing maximum upward planar subgraphs of single-source embedded digraphs

By Rextin Aimal  

Journal of Combinatorial Optimization, Vol. 25, Iss. 3, 2013-04 ,pp. : 368-392

Springer Publishing Company

Access to resources Recommend Favorite