Sanjeev Arora, David R. Karger, Marek Karpinski. Polynomial time approximation schemes for dense instances of ::::NP::::-hard problems. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA. pages 284-293, ACM, 1995. [doi]
Abstract is missing.