## Sanjeev Arora, David R. Karger, Marek Karpinski

*Polynomial time approximation schemes for dense instances of NP-hard problems*

STOC, 1995.

@inproceedings{STOC-1995-AroraKK, author = "Sanjeev Arora and David R. Karger and Marek Karpinski", booktitle = "{Proceedings of the 27th Annual ACM Symposium on Theory of Computing}", doi = "10.1145/225058.225140", isbn = "0-89791-718-9", pages = "284--293", publisher = "{ACM}", title = "{Polynomial time approximation schemes for dense instances of NP-hard problems}", year = 1995, }