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

YouTube

Network Unreliability in Sub-quadratic Time

Simons Institute via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking algorithm for the network unreliability problem in this lecture from the Simons Institute. Delve into Debmalya Panigrahi's presentation on a novel approach that achieves an almost m+n^{1.5} time complexity, surpassing the previous best running time of nearly n^2. Discover how this advancement overcomes the longstanding barrier of enumerating all n^2 min-cuts, a limitation that affected all prior algorithms in this field. Gain insights into the collaborative work behind this innovation, involving researchers from Duke University and the Simons Institute. Understand the significance of this development in the context of #P-hard problems and its implications for optimization and algorithm design in network reliability estimation.

Syllabus

Network Unreliability in Sub-quadratic Time

Taught by

Simons Institute

Reviews

Start your review of Network Unreliability in Sub-quadratic Time

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.