*This preview shows
page 1. Sign up
to
view the full content.*

**Unformatted text preview: **947 33.4 Finding the closest pair of points 957 34 NP-Completeness 966 34.1 Polynomial time 971 34.2 Polynomial-time verication 979 34.3 NP-completeness and reducibility 984 34.4 NP-completeness proofs 995 34.5 NP-complete problems 1003 35 Approximation Algorithms 1022 35.1 The vertex-cover problem 1024 35.2 The traveling-salesman problem 1027 35.3 The set-covering problem 1033 35.4 Randomization and linear programming 1039 35.5 The subset-sum problem 1043 VIII Appendix: Mathematical Background Introduction 1057 A Summations 1058 A.1 Summation formulas and properties 1058 A.2 Bounding summations 1062...

View
Full
Document