Главная
Study mode:
on
1
Intro
2
Introduction: Survivable Network Design
3
Connectivity Augmentation Problem
4
State of the art
5
Classification of Links
6
Cross
7
Reduction to Steiner Tree
8
Reduction to the Steiner Tree Problem
9
Reduction from CAP to Steiner Tree
10
Lower Bound
11
Obtaining Approximation Algorithm
12
Steiner Tree Algorithm
13
Our Marking Scheme
14
Upper Bound for c
15
Analysis of the Approximation Factor
16
Grouping
17
Open Problems
Description:
Explore a groundbreaking conference talk on connectivity augmentation in network design. Delve into the challenge of improving network survivability by adding links to increase connectivity. Learn about the state-of-the-art approaches, including the classification of links and the reduction to the Steiner Tree problem. Discover a novel marking scheme and analysis that breaks the long-standing 2-approximation barrier. Gain insights into the upper bound for cost and the approximation factor analysis. Conclude with a discussion on open problems in this critical area of network optimization and survivability.

Breaching the 2-Approximation Barrier for Connectivity Augmentation

Association for Computing Machinery (ACM)
Add to list
0:00 / 0:00