Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Breaching the 2-Approximation Barrier for Connectivity Augmentation

Hausdorff Center for Mathematics via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking lecture on the Connectivity Augmentation Problem (CAP) presented by Afrouz Jabal Ameli at the Hausdorff Center for Mathematics. Delve into the state-of-the-art research that breaches the long-standing 2-approximation barrier for CAP. Learn about the classification of links, incident links, and the innovative reduction to the Steiner Tree problem. Discover the lower bound techniques, approximation algorithms, and the novel marking scheme that led to this significant advancement. Examine the analysis of the approximation factor, grouping strategies, and recent advances in the field. Conclude with a discussion on open problems, providing insights into future research directions in graph connectivity augmentation.

Syllabus

Intro
Connectivity Augmentation Problem (CAP)
State of the art (Prior to our work)
Our Results
Classification of Links
Incident Links
Reduction to Steiner Tree
Reduction to the Steiner Tree Problem
Reduction from CAP to Steiner Tree
Lower Bound
Obtaining Approximation Algorithm
Steiner Tree Algorithm
How to improve?
Our Marking Scheme
Upper Bound for
Analysis of the Approximation Factor
Grouping
Recent Advances
Open Problems

Taught by

Hausdorff Center for Mathematics

Reviews

Start your review of Breaching the 2-Approximation Barrier for Connectivity Augmentation

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.