The most challenging algorithmic problems involve optimization, where we seek to find a solution that maximizes or minimizes some function. Traveling salesman is a classic optimization problem, where we seek the tour visiting all vertices of a graph at minimum total cost. But as shown in Chapter 1, it is easy to propose “algorithms” solving TSP that generate reasonable-looking solutions but did not always produce the minimum cost tour.
KeywordsDynamic Programming Greedy Algorithm Dynamic Programming Algorithm Edit Distance Recursive Call
Unable to display preview. Download preview PDF.
- [HWK94]T. He, S. Wang, and A. Kaufman. Wavelet-based volume morphing. In Proc. IEEE Visualization ’94, pages 85–92, 1994.Google Scholar
- [KMS97]S. Khanna, M. Muthukrishnan, and S. Skiena. Efficiently partitioning arrays. In Proc. ICALP ’97, volume 1256, pages 616–626. Springer-Verlag LNCS, 1997.Google Scholar
- [MR06]W. Mulzer and G. Rote. Minimum weight triangulation is NP-hard. In Proc. 22nd ACM Symp. on Computational Geometry, pages 1–10, 2006.Google Scholar
- [Woe03]G. Woeginger. Exact algorithms for NP-hard problems: A survey. In Combinatorial Optimization - Eureka! You shrink!, volume 2570 Springer-Verlag LNCS, pages 185–207, 2003.Google Scholar