The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.5, Iss.4, 2001-12, pp. : 411-420

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

Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs

By Krivelevich M. Nathaniel R. Sudakov B.

Journal of Algorithms, Vol. 41, Iss. 1, 2001-10 ,pp. : 99-113

Academic Press

Access to resources Recommend Favorite

A Novel Evolutionary Formulation of the Maximum Independent Set Problem

By Barbosa Valmir C. Campos Luciana C. D.

Journal of Combinatorial Optimization, Vol. 8, Iss. 4, 2004-12 ,pp. : 419-437

Springer Publishing Company

Access to resources Recommend Favorite

An efficient parameterized algorithm for m-set packing

By Jia W. Zhang C. Chen J.

Journal of Algorithms, Vol. 50, Iss. 1, 2004-01 ,pp. : 106-117

Elsevier

Access to resources Recommend Favorite

An efficient fixed-parameter algorithm for 3-Hitting Set

By Niedermeier R. Rossmanith P.

Journal of Discrete Algorithms, Vol. 1, Iss. 1, 2003-02 ,pp. : 89-102

Elsevier

Access to resources Recommend Favorite

Maximum weight k -independent set problem on permutation graphs

By Saha A. Pal M.

International Journal of Computer Mathematics, Vol. 80, Iss. 12, 2003-12 ,pp. : 1477-1487

Taylor & Francis Ltd

Access to resources Recommend Favorite