Speaker R. Ravi
Affiliation Tepper School of Business
Host Ravi Kannan
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