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

Efficient 2-Approximation Algorithms for Computing 2-Connected Steiner Minimal Networks

โœ Scribed by Hong Shen; Longkun Guo

Book ID
114607438
Publisher
IEEE
Year
2012
Tongue
English
Weight
799 KB
Volume
61
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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