Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems

Sanjeev Arora, David R. Karger, Marek Karpinski. Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems. J. Comput. Syst. Sci., 58(1):193-210, 1999.

Abstract

Abstract is missing.