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