✦ LIBER ✦

Faster approximation algorithms for weighted triconnectivity augmentation problems

✍ Scribed by Zeev Nutov; Michal Penn

Book ID: 108410528
Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 81 KB
Volume: 21
Category: Article
ISSN: 0167-6377
DOI: 10.1016/s0167-6377(97)00045-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Approximation Algorithms for Constrained

Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems

✍ Moss, A.; Rabani, Y. 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 241 KB

Approximation Algorithms for Graph Augme

Approximation Algorithms for Graph Augmentation

✍ S. Khuller; R. Thurimella 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 500 KB

Faster Approximation Algorithms for the

Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem

✍ U. Fößmeier; M. Kaufmann; A. Zelikovsky 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 217 KB

Approximation algorithms for weighted ma

Approximation algorithms for weighted matching

✍ Shankar M. Venkatesan 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 643 KB

A faster algorithm for the maximum weigh

A faster algorithm for the maximum weighted tardiness problem

✍ Malcolm C. Fields; Greg N. Frederickson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 503 KB