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

by S Arora, D Karger, M Karpinski
Venue:In Proceedings of the twenty-seventh annual ACM symposium on Theory of computing