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

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

Publisher： MAIK Nauka/Interperiodica

ISSN： 0081-5438

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

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

Finding paths with minimum shared edges

By Omran Masoud   Sack Jörg-Rüdiger   Zarrabi-Zadeh Hamid  

Journal of Combinatorial Optimization, Vol. 26, Iss. 4, 2013-11 ,pp. : 709-722

Springer Publishing Company

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

An efficient distributed algorithm for finding all hinge vertices in networks

By Ho Ting-yem  

International Journal of Computer Mathematics, Vol. 82, Iss. 7, 2005-07 ,pp. : 821-825

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Better Approximation Algorithm for Finding Planar Subgraphs

By Calinescu G.   Fernandes C.G.   Finkler U.   Karloff H.  

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

Academic Press

Access to resources Recommend Favorite

An almost four-approximation algorithm for maximum weight triangulation

By Hu Shiyan  

Journal of Combinatorial Optimization, Vol. 19, Iss. 1, 2010-01 ,pp. : 31-42

Springer Publishing Company

Access to resources Recommend Favorite