The Complexity of Approximating Averages on Bounded-Degree Graphs
Offered By: IEEE via YouTube
Course Description
Overview
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
Tags
Related Courses
Approximation Algorithms Part IÉcole normale supérieure via Coursera Approximation Algorithms Part II
École normale supérieure via Coursera Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford University via Coursera Algorithm Design and Analysis
University of Pennsylvania via edX Delivery Problem
University of California, San Diego via Coursera