๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity

โœ Scribed by Tsan-sheng Hsu; Ming-Yang Kao

Book ID
110279611
Publisher
Springer US
Year
1998
Tongue
English
Weight
158 KB
Volume
2
Category
Article
ISSN
1382-6905

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

A Static 2-Approximation Algorithm for V
A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity
โœ Monika Rauch Henzinger ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 329 KB

This paper presents insertions-only algorithms for maintaining the exact andror approximate size of the minimum edge cut and the minimum vertex cut of a graph. ลฝ . The algorithms output the approximate or exact size k in time O 1 and a cut of size k in time linear in its size. For the minimum edge