@article {17637,
	title = {On the approximability of clique and related maximization problems},
	journal = {Journal of Computer and System Sciences},
	volume = {67},
	year = {2003},
	month = {2003/11//},
	pages = {633 - 651},
	abstract = {We consider approximations of the form n1-o(1) for the Maximum Clique problem, where n is the number of vertices in the input graph and where the {\textquotedblleft}o(1){\textquotedblright} term goes to zero as n increases. We show that sufficiently strong negative results for such problems, which we call strong inapproximability results, have interesting consequences for exact computation. A simple sampling method underlies most of our results.},
	keywords = {Approximation algorithms, Clique, Inapproximability, Independent set, Packing integer programs, random sampling},
	isbn = {0022-0000},
	doi = {10.1016/S0022-0000(03)00110-7},
	url = {http://www.sciencedirect.com/science/article/pii/S0022000003001107},
	author = {Srinivasan, Aravind}
}
@conference {17669,
	title = {The value of strong inapproximability results for clique},
	booktitle = {Proceedings of the thirty-second annual ACM symposium on Theory of computing},
	series = {STOC {\textquoteright}00},
	year = {2000},
	month = {2000///},
	pages = {144 - 152},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {<italic>P</italic> vs. <italic>NP</italic>, Approximation algorithms, Clique, inapproximabilit, Independent set, Packing integer programs, random sampling},
	isbn = {1-58113-184-4},
	doi = {10.1145/335305.335322},
	url = {http://doi.acm.org/10.1145/335305.335322},
	author = {Srinivasan, Aravind}
}
