Overview
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the intricacies of approximating averages on bounded-degree graphs in this 24-minute IEEE conference talk presented by Andreas Galanis from Oxford, Daniel Stefankovic from the University of Rochester, and Eric Vigoda from Georgia Tech. Delve into the computational challenges and theoretical aspects of this problem, gaining insights into graph theory, approximation algorithms, and complexity analysis.
Syllabus
The complexity of approximating averages on bounded-degree graphs
Taught by
IEEE FOCS: Foundations of Computer Science