{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:20:05Z","timestamp":1794342005936,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540372714","type":"print"},{"value":"9783540372738","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11816157_99","type":"book-chapter","created":{"date-parts":[[2006,8,31]],"date-time":"2006-08-31T07:46:55Z","timestamp":1157010415000},"page":"822-831","source":"Crossref","is-referenced-by-count":4,"title":["An Improved Simulated Annealing Algorithm for the Maximum Independent Set Problem"],"prefix":"10.1007","author":[{"given":"Xinshun","family":"Xu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hua","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"99_CR1","series-title":"The Charles Babbage Research Center","volume-title":"An Introduction to the Design and Analysis of Algorithms","author":"D.R. Stinson","year":"1987","unstructured":"Stinson, D.R.: An Introduction to the Design and Analysis of Algorithms, 2nd edn. The Charles Babbage Research Center, Winnipeg, Manitoba, Canada (1987)","edition":"2"},{"key":"99_CR2","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computation","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computation, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"99_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)"},{"key":"99_CR4","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D. Johnson","year":"1974","unstructured":"Johnson, D.: Approximate Algorithms for Combinatorial Problems. Journal of Computer and System Sciences\u00a09, 256\u2013278 (1974)","journal-title":"Journal of Computer and System Sciences"},{"key":"99_CR5","first-page":"119","volume-title":"External Memory Algorithms and Visualization. DIMACS series on discrete mathematics and theoretical Computer Science","author":"J. Abello","year":"1999","unstructured":"Abello, J., Pardalos, P.M., Resende, M.G.C.: On the Maximum Clique Problems in very Large Graphs. In: Abello, J., Vitter, J.S. (eds.) External Memory Algorithms and Visualization. DIMACS series on discrete mathematics and theoretical Computer Science, vol.\u00a050, pp. 119\u2013130. American Mathematical Society, Providence (1999)"},{"key":"99_CR6","volume-title":"Economic Applications of the Theory of Graphs","author":"G. Avondo-Bodeno","year":"1962","unstructured":"Avondo-Bodeno, G.: Economic Applications of the Theory of Graphs. Gordon and Breach Science, New York (1962)"},{"key":"99_CR7","volume-title":"The Theory of Graphs and Its Applications","author":"C. Berge","year":"1962","unstructured":"Berge, C.: The Theory of Graphs and Its Applications. John Wiley and Sons, New York (1962)"},{"key":"99_CR8","first-page":"1","volume-title":"Handbook of Combinatorial Optimization","author":"I.M. Bomze","year":"1999","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillot, M.: The maximum clique problem. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 1\u201374. Kluwer Academic Publishers, Dordrecht (1999)"},{"issue":"4","key":"99_CR9","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/4221.4226","volume":"32","author":"R.M. Karp","year":"1985","unstructured":"Karp, R.M., Wigderson, A.: A Fast Parallel Algorithm for the Maximal Independent Set Problem. Journal of the ACM\u00a032(4), 762\u2013773 (1985)","journal-title":"Journal of the ACM"},{"key":"99_CR10","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N. Alon","year":"1986","unstructured":"Alon, N., Babai, L., Itai, A.: A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. Journal of Algorithms\u00a07, 567\u2013583 (1986)","journal-title":"Journal of Algorithms"},{"key":"99_CR11","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1137\/0218029","volume":"18","author":"M. Goldberg","year":"1989","unstructured":"Goldberg, M., Spencer, T.: A New Parallel Algorithm for the Maximal Independent Set Problem. SIAM Journal on Computing\u00a018, 419\u2013427 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"99_CR12","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1137\/0402028","volume":"2","author":"M. Goldberg","year":"1989","unstructured":"Goldberg, M., Spencer, T.: Constructing a Maximal Independent Set in Parallel. SIAM Journal on Discrete Mathematics\u00a02, 322\u2013328 (1989)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"99_CR13","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1137\/0406036","volume":"6","author":"M. Goldberg","year":"1993","unstructured":"Goldberg, M., Spencer, T.: An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size. SIAM Journal on Discrete Mathematics\u00a06, 443\u2013459 (1993)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"99_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1109\/72.80251","volume":"1","author":"Y. Takefuji","year":"1990","unstructured":"Takefuji, Y., Chen, L., Lee, K., Huffman, J.: Parallel Algorithm for Finding a Near Maximum Independent Set of the Circle Graph. IEEE Transaction on Neural Networks\u00a01, 263\u2013267 (1990)","journal-title":"IEEE Transaction on Neural Networks"},{"key":"99_CR15","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1109\/ICEC.1994.350004","volume-title":"Proceeding of the First IEEE Conference on Evolutionary Computation","author":"T. B\u00e4ck","year":"1994","unstructured":"B\u00e4ck, T., Khuri, S.: An Evolutionary Heuristic for the Maximum Independent Set Problem. In: Michalewicz, Z., Schaffer, J.D., Schwefel, H.P., Fogel, D.B., Kitano, H. (eds.) Proceeding of the First IEEE Conference on Evolutionary Computation, pp. 531\u2013535. IEEE Press, New York (1994)"},{"key":"99_CR16","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/A:1014899909753","volume":"6","author":"S. Busygin","year":"2002","unstructured":"Busygin, S., Butenko, S., Pardalos, P.: A Heuristic for the Maximum Independent Set Problem Based on Optimization of a Quadratic over a Sphere. Journal of Combinatorial Optimization\u00a06, 287\u2013297 (2002)","journal-title":"Journal of Combinatorial Optimization"},{"key":"99_CR17","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s002240000113","volume":"32","author":"P. Berman","year":"1999","unstructured":"Berman, P., Fujito, T.: On Approximation Properties of the Independent Set Problem for Low Degree Graphs. Theory of Computing Systems\u00a032, 115\u2013132 (1999)","journal-title":"Theory of Computing Systems"},{"key":"99_CR18","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0020-0190(92)90228-N","volume":"42","author":"E. Dahlhaus","year":"1992","unstructured":"Dahlhaus, E., Karpinski, M., Kelsen, P.: An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3. Information Processing Letters\u00a042, 309\u2013313 (1992)","journal-title":"Information Processing Letters"},{"key":"99_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-0721-7","volume-title":"Intelligent Optimisation Techniques: Genetic Algorithm, Tabu Search, Simulated Annealing, and Neural Networks","author":"D.T. Pham","year":"2000","unstructured":"Pham, D.T., Karaboga, D.: Intelligent Optimisation Techniques: Genetic Algorithm, Tabu Search, Simulated Annealing, and Neural Networks. Springer, Heidelberg (2000)"},{"key":"99_CR20","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF02523693","volume":"18","author":"M.M. Halld\u00f3rsson","year":"1997","unstructured":"Halld\u00f3rsson, M.M., Radhakrishnan, J.: Greed is good: Approximating Independent Sets in Sparse and Bounded-degree Graphs. Algorithmica\u00a018, 145\u2013163 (1997)","journal-title":"Algorithmica"},{"key":"99_CR21","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1109\/12.663765","volume":"47","author":"S.-Y. Yuan","year":"1998","unstructured":"Yuan, S.-Y., Kuo, S.-Y.: A New Technique for Optimization Problems in Graph Theory. IEEE Transactions on Computers\u00a047, 190\u2013196 (1998)","journal-title":"IEEE Transactions on Computers"},{"key":"99_CR22","first-page":"356","volume-title":"Proceeding of the Second Chapel Hill Conference on Combinatory Mathematics and its Applications","author":"D.W. Matual","year":"1970","unstructured":"Matual, D.W.: On the Complete Subgraph of a Random Graph\u201d. In: Bose, R., Dowling, T. (eds.) Proceeding of the Second Chapel Hill Conference on Combinatory Mathematics and its Applications, pp. 356\u2013369. Chapel Hill, North Carolina (1970)"},{"key":"99_CR23","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s00453-001-0105-8","volume":"33","author":"A. Bertoni","year":"2002","unstructured":"Bertoni, A., Campadelli, P., Grossi, G.: A Neural Algorithm for the Maximum Clique Problem: Analysis, Experiments, and Circuit Implementation. Algorithmica\u00a033, 71\u201388 (2002)","journal-title":"Algorithmica"},{"key":"99_CR24","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1109\/72.377977","volume":"6","author":"S. Jagota","year":"1995","unstructured":"Jagota, S.: Approximating Maximum Clique with a Hopfield Network. IEEE Transactions on Neural Networks\u00a06, 724\u2013735 (1995)","journal-title":"IEEE Transactions on Neural Networks"},{"key":"99_CR25","first-page":"452","volume":"4","author":"N. Funabiki","year":"1996","unstructured":"Funabiki, N., Nishikawa, S.: Comparisons of Energy-descent Optimization Algorithms for Maximum Clique Problems. IEICE Transactions on Fundamentals\u00a0E79-A(4), 452\u2013460 (1996)","journal-title":"IEICE Transactions on Fundamentals"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11816157_99.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:29:36Z","timestamp":1619494176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11816157_99"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372714","9783540372738"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11816157_99","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11816157","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}