Polynomial time approximation schemes for dense instances of NP-hard problems. (1995)

by Sanjeev Arora, David R Karger, Marek Karpinski
Venue:In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing,