Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Local Search

Speaker  R. Ravi

Affiliation  Tepper School of Business

Host  Ravi Kannan

Duration  01:38:19

Date recorded  19 December 2012

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).

©2012 Microsoft Corporation. All rights reserved.
By the same speaker
> Local Search