✦ LIBER ✦

Improved approximation of maximum vertex cover

✍ Scribed by Anna Galluccio; Paolo Nobili

Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 188 KB
Volume: 34
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2005.03.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Iterative improvement of vertex covers

✍ Youssef Saab 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 300 KB

Approximation algorithms for covering a

Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight

✍ Shlomo Moran; Ilan Newman; Yaron Wolfstahl 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 464 KB

Vertex Cover: Further Observations and F

Vertex Cover: Further Observations and Further Improvements

✍ Jianer Chen; Iyad A. Kanj; Weijia Jia 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 172 KB

Recently, there has been increasing interest and progress in lowering the worstcase time complexity for well-known NP-hard problems, particularly for the Vertex Cover problem. In this paper, new properties for the Vertex Cover problem are indicated, and several simple and new techniques are introduc

Improvement on vertex cover for low-degr

Improvement on vertex cover for low-degree graphs

✍ Jianer Chen; Lihua Liu; Weijia Jia 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB 👁 2 views

A linear-time approximation algorithm fo

A linear-time approximation algorithm for the weighted vertex cover problem

✍ R Bar-Yehuda; S Even 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 257 KB

A graph approximation heuristic for the

A graph approximation heuristic for the vertex cover problem on planar graphs

✍ D.L. Meek; R. Gary Parker 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 684 KB