Breaching the 2-Approximation Barrier for Connectivity Augmentation

Breaching the 2-Approximation Barrier for Connectivity Augmentation

Association for Computing Machinery (ACM) via YouTube Direct link

Grouping

16 of 17

16 of 17

Grouping

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Breaching the 2-Approximation Barrier for Connectivity Augmentation

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Introduction: Survivable Network Design
  3. 3 Connectivity Augmentation Problem
  4. 4 State of the art
  5. 5 Classification of Links
  6. 6 Cross
  7. 7 Reduction to Steiner Tree
  8. 8 Reduction to the Steiner Tree Problem
  9. 9 Reduction from CAP to Steiner Tree
  10. 10 Lower Bound
  11. 11 Obtaining Approximation Algorithm
  12. 12 Steiner Tree Algorithm
  13. 13 Our Marking Scheme
  14. 14 Upper Bound for c
  15. 15 Analysis of the Approximation Factor
  16. 16 Grouping
  17. 17 Open Problems

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.