𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover

✍ Scribed by Daniel Mölle; Stefan Richter; Peter Rossmanith

Publisher
Springer
Year
2007
Tongue
English
Weight
483 KB
Volume
43
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pushdown–reduce: an algorithm for connec
Pushdown–reduce: an algorithm for connectivity augmentation and poset covering problems
✍ András A. Benczúr 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 557 KB

In their seminal paper, Frank and Jordà an show that a large class of optimization problems including certain directed edge augmentation ones fall into the class of covering supermodular functions over pairs of sets. They also give an algorithm for such problems, however, that relies on the ellipsoi

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