![]() |
@article{DBLP:journals/cpc/Verbitsky95,
author = {Oleg Verbitsky},
title = {On the Hardness of Approximating Some Optimization Problems
That Are Supposedly Easier Than MAX CLIQUE},
journal = {Combinatorics, Probability {\&} Computing},
volume = {4},
year = {1995},
pages = {167-180},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2004-09-07 by Michael Ley (ley@uni-trier.de)