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]
@inproceedings{AroraKK95,
title = {Polynomial time approximation schemes for dense instances of ::::NP::::-hard problems},
author = {Sanjeev Arora and David R. Karger and Marek Karpinski},
year = {1995},
doi = {10.1145/225058.225140},
url = {http://doi.acm.org/10.1145/225058.225140},
researchr = {https://researchr.org/publication/AroraKK95},
cites = {0},
citedby = {0},
pages = {284-293},
booktitle = {Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA},
publisher = {ACM},
}