Explore a 22-minute IEEE conference talk on approximation algorithms for stochastic minimum norm combinatorial optimization, presented by Sharat Ibrahimpur and Chaitanya Swamy from Waterloo. Delve into advanced mathematical concepts and algorithmic approaches for solving complex optimization problems in uncertain environments.
Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization
Overview
Syllabus
Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization
Taught by
IEEE FOCS: Foundations of Computer Science
