{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:50:10Z","timestamp":1744217410350},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3546,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1016\/s0022-0000(03)00110-7","type":"journal-article","created":{"date-parts":[[2003,7,22]],"date-time":"2003-07-22T18:14:27Z","timestamp":1058897667000},"page":"633-651","source":"Crossref","is-referenced-by-count":13,"title":["On the approximability of clique and related maximization problems"],"prefix":"10.1016","volume":"67","author":[{"given":"Aravind","family":"Srinivasan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00110-7_BIB1","series-title":"External Memory Algorithms","first-page":"119","article-title":"On maximum clique problems in very large graphs","volume":"Vol. 50","author":"Abello","year":"1999"},{"key":"10.1016\/S0022-0000(03)00110-7_BIB2","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","article-title":"Proof verification and the hardness of approximation problems","volume":"45","author":"Arora","year":"1998","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(03)00110-7_BIB3","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1145\/273865.273901","article-title":"Probabilistic checking of proofs","volume":"45","author":"Arora","year":"1998","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(03)00110-7_BIB4","unstructured":"A. Blum, Algorithms for approximate graph coloring, Ph.D. Thesis, Dept. of Electrical Engineering and Computer Science, MIT, 1991."},{"key":"10.1016\/S0022-0000(03)00110-7_BIB5","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF01994876","article-title":"Approximating maximum independent sets by excluding subgraphs","volume":"32","author":"Boppana","year":"1992","journal-title":"BIT"},{"key":"10.1016\/S0022-0000(03)00110-7_BIB6","doi-asserted-by":"crossref","unstructured":"L. Engebretsen, J. Holmerin, Clique is hard to approximate within n1\u2212o(1), in: Proceedings of International Colloquium on Automata, Languages and Programming, Geneva, Switzerland, 2000, pp. 2\u201312.","DOI":"10.1007\/3-540-45022-X_2"},{"key":"10.1016\/S0022-0000(03)00110-7_BIB7","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01196133","article-title":"Randomized graph products, chromatic numbers, and the Lov\u00e1sz \u03d1-function","volume":"17","author":"Feige","year":"1997","journal-title":"Combinatorica"},{"key":"10.1016\/S0022-0000(03)00110-7_BIB8","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/226643.226652","article-title":"Interactive proofs and the hardness of approximating cliques","volume":"43","author":"Feige","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(03)00110-7_BIB9","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1006\/jcss.1999.1671","article-title":"Time\u2013space trade-offs for satisfiability","volume":"60","author":"Fortnow","year":"2000","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(03)00110-7_BIB10","doi-asserted-by":"crossref","unstructured":"M.M. Halld\u00f3rsson, Approximations of independent sets in graphs, in: Proceedings of APPROX \u201998 Conference, Springer-Verlag Lecture Notes in Computer Science, Vol. 1444, Springer, Berlin, 1998, pp. 1\u201313.","DOI":"10.1007\/BFb0053959"},{"key":"10.1016\/S0022-0000(03)00110-7_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00020","article-title":"Approximations of weighted independent set and hereditary subset problems","volume":"4","author":"Halld\u00f3rsson","year":"2000","journal-title":"J. Graph Algorithms Appl."},{"key":"10.1016\/S0022-0000(03)00110-7_BIB12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","article-title":"Clique is hard to approximate within n1\u2212\u03b5","volume":"182","author":"H\u00e5stad","year":"1999","journal-title":"Acta Math."},{"key":"10.1016\/S0022-0000(03)00110-7_BIB13","doi-asserted-by":"crossref","unstructured":"S. Khot, Improved inapproximability results for maxclique, chromatic number and approximate graph coloring, in: Proceedings of IEEE Symposium on Foundations of Computer Science, Las Vegas, NV, 2001, pp. 600\u2013609.","DOI":"10.1109\/SFCS.2001.959936"},{"key":"10.1016\/S0022-0000(03)00110-7_BIB14","doi-asserted-by":"crossref","unstructured":"M. Krivelevich, V. Vu, Approximating the independence number and the chromatic number in expected polynomial time, in: Proceedings of International Colloquium on Automata, Languages and Programming, Geneva, Switzerland, 2000, pp. 13\u201324.","DOI":"10.1007\/3-540-45022-X_3"},{"key":"10.1016\/S0022-0000(03)00110-7_BIB15","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","article-title":"Probabilistic construction of deterministic algorithms","volume":"37","author":"Raghavan","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(03)00110-7_BIB16","doi-asserted-by":"crossref","unstructured":"A. Samorodnitsky, L. Trevisan, A PCP characterization of NP with optimal amortized query complexity, in: Proceedings of ACM Symposium on Theory of Computing, Portland, OR, 2000, pp. 191\u2013199.","DOI":"10.1145\/335305.335329"},{"key":"10.1016\/S0022-0000(03)00110-7_BIB17","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/S089548019223872X","article-title":"Chernoff\u2013Hoeffding bounds for applications with limited independence","volume":"8","author":"Schmidt","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0022-0000(03)00110-7_BIB18","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1137\/S0097539796314240","article-title":"Improved approximation guarantees for packing and covering integer programs","volume":"29","author":"Srinivasan","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00110-7_BIB19","doi-asserted-by":"crossref","unstructured":"A.C.-C. Yao, Probabilistic computations: towards a unified measure of complexity, in: Proceedings of IEEE Symposium on Foundations of Computer Science, Providence, RI, 1977, pp. 222\u2013227.","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003001107?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003001107?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T06:21:53Z","timestamp":1552803713000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003001107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S0022000003001107"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00110-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}