Intractable Problems and Approximation Algorithms
We now introduce techniques for proving that no efficient algorithm exists for a given problem. The practical reader is probably squirming at the notion of proving anything, and will be particularly alarmed at the idea of investing time to prove that something does not exist. Why are you better off knowing that something you don’t know how to do in fact can’t be done at all?
KeywordsApproximation Algorithm Span Tree Minimum Span Tree Travel Salesman Problem Hamiltonian Cycle
Unable to display preview. Download preview PDF.
- [Coo71]S. Cook. The complexity of theorem proving procedures. In Proc. Third ACM Symp. Theory of Computing, pages 151–158, 1971.Google Scholar
- [Kar72]R. M. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85–103. Plenum Press, 1972.Google Scholar
- [Mah76]S. Maheshwari. Traversal marker placement problems are NP-complete. Technical Report CU-CS-09276, Department of Computer Science, University of Colorado, Boulder, 1976.Google Scholar