%0 Conference Paper %1 conf/stoc/AroraKK95 %A Arora, Sanjeev %A Karger, David R. %A Karpinski, Marek %B STOC %D 1995 %E Leighton, Frank Thomson %E Borodin, Allan %I ACM %K dblp %P 284-293 %T Polynomial time approximation schemes for dense instances of NP-hard problems. %U http://dblp.uni-trier.de/db/conf/stoc/stoc1995.html#AroraKK95 %@ 0-89791-718-9

@inproceedings{conf/stoc/AroraKK95, added-at = {2018-11-06T00:00:00.000+0100}, author = {Arora, Sanjeev and Karger, David R. and Karpinski, Marek}, biburl = {https://www.bibsonomy.org/bibtex/2d4c169f74b72876c6e731d06eec3afbd/dblp}, booktitle = {STOC}, crossref = {conf/stoc/STOC27}, editor = {Leighton, Frank Thomson and Borodin, Allan}, ee = {https://doi.org/10.1145/225058.225140}, interhash = {1c09fef0a923dc568bde653e615d8de9}, intrahash = {d4c169f74b72876c6e731d06eec3afbd}, isbn = {0-89791-718-9}, keywords = {dblp}, pages = {284-293}, publisher = {ACM}, timestamp = {2018-11-07T14:44:33.000+0100}, title = {Polynomial time approximation schemes for dense instances of NP-hard problems.}, url = {http://dblp.uni-trier.de/db/conf/stoc/stoc1995.html#AroraKK95}, year = 1995 }