✦ LIBER ✦

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

✍ Scribed by R Bar-Yehuda; S Even

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 257 KB
Volume: 2
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(81)90020-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parallel algorithm for the minimum wei

A parallel algorithm for the minimum weighted vertex cover problem

✍ Aristidis Likas; Andreas Stafylopatis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 522 KB

A simple LP-free approximation algorithm

A simple LP-free approximation algorithm for the minimum weight vertex cover problem

✍ Teofilo F. Gonzalez 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 290 KB

Linear time algorithms for approximating

Linear time algorithms for approximating the facility terminal cover problem

✍ Guang Xu; Yang Yang; Jinhui Xu 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 413 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

Linear Time Algorithms for Knapsack Prob

Linear Time Algorithms for Knapsack Problems with Bounded Weights

✍ David Pisinger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 140 KB

NOTE Improved Approximation Algorithms f

NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems

✍ Michal Penn; Haya Shasha-Krupnik 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 126 KB

The problem of finding a minimum augmenting edge-set to make a graph k-vertex connected is considered. This problem is denoted as the minimum k-augmentation problem. For weighted graphs, the minimum k-augmentation problem is NP-complete. Our main result is an approximation algorithm with a performan