Improved non-approximability results for minimum vertex cover with density costraints

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.225, Iss.1, 1999-08, pp. : 113-128

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

Non-approximability of weighted multiple sequence alignment

By Manthey B.

Theoretical Computer Science, Vol. 296, Iss. 1, 2003-03 ,pp. : 179-192

Elsevier

Access to resources Recommend Favorite

Approximability of Minimum AND-Circuits

By Arpe Jan Manthey Bodo

Algorithmica, Vol. 53, Iss. 3, 2009-03 ,pp. : 337-357

Springer Publishing Company

Access to resources Recommend Favorite

An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem

By Shyu Shyong Yin Peng-Yeng Lin Bertrand

Annals of Operations Research, Vol. 131, Iss. 1-4, 2004-10 ,pp. : 283-304

Springer Publishing Company

Access to resources Recommend Favorite

Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms

By Chen J. Kanj I.A.

Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. : 833-847

Elsevier

Access to resources Recommend Favorite

Tight Results on Minimum Entropy Set Cover

By Cardinal Jean Fiorini Samuel Joret Gwenaël

Algorithmica, Vol. 51, Iss. 1, 2008-05 ,pp. : 49-60

Springer Publishing Company

Access to resources Recommend Favorite