Greedy Algorithms - Part 2

Channel:
Microsoft Research
Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=Cd7R7vGoxf0


Duration: 45:12
723 views
13

The lecture starts with an outline of the topics proposed to be covered, followed by an introduction to greedy algorithms illustrated using the set cover problem (logarithmic ratio approximation). The homework assigned was to analyze the greedy method applied to Uncapacitated Facility Location, and the Generalized Steiner Forest problems.



Other Videos By Microsoft Research


2016-08-11Differential Privacy - Lecture 3
2016-08-11Big Data Processing on the Cheap
2016-08-11Differential Privacy - Lecture 1
2016-08-11Towards Provable Bounds for Machine Learning - Lecture 2 Part 2
2016-08-11Handling Big Data for the Environmental Informatics; Real-Time Environmental Observation
2016-08-11Machine Learning Course - Lecture 4
2016-08-11From Algorithms to Auctions
2016-08-11A Noise-Robust Speech Recognition Method
2016-08-11Machine Learning Course - Lecture 15
2016-08-11The Virtual Lab
2016-08-11Greedy Algorithms - Part 2
2016-08-11Comedy of Contingency: Making and Capturing of Physical Comedy in Video Game Spaces
2016-08-11The Applicant Auction for Top-Level Domains: Using an Auction to Efficiently Resolve Conflicts
2016-08-11Spectral Embedding and Higher-Order Cheeger Inequalities
2016-08-11Miku: Virtual Idol as Media Platform
2016-08-11From motion capture of interacting hands to video based rendering.
2016-08-11Novel Approaches to Data Visualization
2016-08-11Machine Learning Course - Lecture 9
2016-08-11Stochastic Optimization and Sparse Statistical Recovery: An Optimal Algorithm for High Dimensions
2016-08-11Jim Grey Award & The Possibilities and Pitfalls Internet-Based Chemical Data
2016-08-11WP8 - Using native code in ISV apps


Tags:
microsoft research