An O(1)-Approximation for Minimum Spanning Tree Interdiction

An O(1)-Approximation for Minimum Spanning Tree Interdiction

Hausdorff Center for Mathematics via YouTube Direct link

Parametric front

21 of 23

21 of 23

Parametric front

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

An O(1)-Approximation for Minimum Spanning Tree Interdiction

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

  1. 1 Intro
  2. 2 What is interdiction
  3. 3 Context
  4. 4 Infection Control
  5. 5 Protecting Infrastructure
  6. 6 Connectivity Interdiction
  7. 7 Network Interdiction
  8. 8 General Techniques
  9. 9 Mathematical Program
  10. 10 Maxim SD Flow
  11. 11 Minimum SD Cut
  12. 12 Disclaimer
  13. 13 Nominal
  14. 14 Assumptions
  15. 15 Maximum Component Problem
  16. 16 Recap
  17. 17 Additional Assumptions
  18. 18 HighLevel Approach
  19. 19 Connected Components
  20. 20 Value of an MST
  21. 21 Parametric front
  22. 22 Theorem
  23. 23 Summary

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.