Local Search

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


Duration: 1:38:25
8,033 views
63

The Local Search method was illustrated using three problems: Maximum cut (2-approximation), Maximum leaf spanning trees (10-approximation) and the metric k-median problem (3-approximation).



Other Videos By Microsoft Research


2016-08-12Tap into smart search with Bing APIs from Microsoft Cognitive Services
2016-08-11Metric Rounding of LP Relaxations
2016-08-11AstroInformatics 2012: Day 1 Session 4
2016-08-11New Directions in Networked Systems Design - Session 2
2016-08-11Towards Provable Bounds for Machine Learning - Lecture 3
2016-08-11Linear Programs and Deterministic Rounding
2016-08-11Towards Provable Bounds for Machine Learning - Lecture 1
2016-08-11Filtering and the Primal-Dual Method - Part 2
2016-08-11Differential Privacy - Lecture 2
2016-08-11Towards Provable Bounds for Machine Learning - Lecture 2 Part 1
2016-08-11Local Search
2016-08-11Differential Privacy - Lecture 4
2016-08-11How to Approximate it? Introduction and Greedy Algorithms - Part 1
2016-08-11Differential Privacy - Lecture 5
2016-08-11Filtering and the Primal-Dual Method - Part 1
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


Tags:
microsoft research