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.
The Complexity of Approximating Averages on Bounded-Degree Graphs
Overview
Syllabus
The complexity of approximating averages on bounded-degree graphs
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
-
Recent Developments in Testing Bounded-Degree Graphs
-
Planar Partition Oracles for Bounded Degree Graphs in Polynomial Time
-
The Complexity of 3-Colouring H-Colourable Graphs
-
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach
-
Towards Better Approximation of Graph Crossing Number
-
Andreas E. Feldmann - A -embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
