In the previous chapters of Part II of this book we have shown how linear programs provide a systematic way of placing a good lower bound on OPT (assuming a minimization problem), for numerous NP-hard problems. As stated earlier, this is a key step in the design of an approximation algorithm for an NP-hard problem. It is natural, then, to ask if there are other widely applicable ways of doing this.
Unable to display preview. Download preview PDF.
- 90.U. Feige and G. Schechtman. On the optimality of the random hyperplane rounding technique for MAX-CUT. In Proc. 33rd ACM Symposium on the Theory of Computing, 2001.Google Scholar
- 222.Y. Nesterov and A. Nemirovskii. Interior Point Polynomial Methods in Convex Programming. SIAM, Philadelphia, PA, 1994.Google Scholar