{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T05:33:17Z","timestamp":1781328797442,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540434009","type":"print"},{"value":"9783540459958","type":"electronic"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45995-2_51","type":"book-chapter","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T02:33:34Z","timestamp":1180492414000},"page":"598-612","source":"Crossref","is-referenced-by-count":180,"title":["Massive Quasi-Clique Detection"],"prefix":"10.1007","author":[{"given":"James","family":"Abello","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sandra","family":"Sudarsky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"51_CR1","doi-asserted-by":"crossref","unstructured":"J. Abello, P. Pardalos and M. Resende, editors. Handbook of Massive Data Sets, Kluwer Academic Publishers, 2002.","DOI":"10.1007\/978-1-4615-0005-6"},{"key":"51_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-68530-8_28","volume-title":"European Symposium on Algorithms","author":"J. Abello","year":"1998","unstructured":"J. Abello, A. Bushbaum, and J. Westbrook. A functional approach to external memory algorithms. In European Symposium on Algorithms, volume 1461 of Lecture Notes in Computer Science, pages 332\u2013343. Springer-Verlag, 1998."},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"J. Abello and J. Vitter, editors. External Memory Algorithms, volume 50 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1999.","DOI":"10.1090\/dimacs\/050"},{"key":"51_CR4","doi-asserted-by":"crossref","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. Proc. 33rd IEEE Symp. on Foundations of Computer Science, pages 14\u201323, 1992.","DOI":"10.1109\/SFCS.1992.267823"},{"key":"51_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S. Arora","year":"1998","unstructured":"S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. J. of the ACM, volume 45, pages 70\u2013122, 1998.","journal-title":"J. of the ACM"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"U. Feige, S. Goldwasser, L. Lov\u00e1sz, S. Safra, and M. Szegedy. Approximating the maximum clique is almost NP-complete. In Proc. 32nd IEEE Symp. on Foundations of Computer Science, pages 2\u201312, 1991.","DOI":"10.1109\/SFCS.1991.185341"},{"key":"51_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"T.A. Feo and M.G.C. Resende. A probabilistic heuristic for a computationally dificults et covering problem. Operations Research Letters, volume 8, pages 67\u201371, 1989.","journal-title":"Operations Research Letters"},{"key":"51_CR8","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover. Tabu search. PartI. ORSA J. Comput., volume 1, pages 190\u2013206, 1989.","journal-title":"ORSA J. Comput."},{"key":"51_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"J. H\u00e5stad, Clique is hard to approximate within n 1-\u2208. Acta Mathematica, volume 182, pages 105\u2013142, 1999.","journal-title":"Acta Mathematica"},{"key":"51_CR10","volume-title":"Adaptation in Natural and Artificial Systems","author":"J. H. Holland","year":"1975","unstructured":"J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI, 1975."},{"key":"51_CR11","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"S. Kirkpatrick, C. D. Gellat Jr., and M. P. Vecchi. Optimization by simulated annealing. Science, volume 220, 671\u2013680, 1983.","journal-title":"Science"},{"key":"51_CR12","unstructured":"L.S. Pitsoulis and M.G.C. Resende. Greedy randomized adaptive search procedures. In P. M. Pardalos and M. G. C. Resende, editors, Handbook of Applied Optimization. Oxford University Press, pages 168\u2013182, 2002."}],"container-title":["Lecture Notes in Computer Science","LATIN 2002: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45995-2_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T19:25:38Z","timestamp":1737055538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45995-2_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434009","9783540459958"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45995-2_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002]]}}}