YoVDO

Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization

Offered By: IEEE via YouTube

Tags

Approximation Algorithms Courses Algorithm Design Courses Mathematical Modeling Courses Combinatorial Optimization Courses Uncertainty Analysis Courses Stochastic Optimization Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization


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