Finding maximum cliques with distributed ants

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3102, Issue , 2004, Pages 24-35

  Bui, Thang N ^a   Rizzo Jr , Joseph R ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS;

ANT SYSTEM ALGORITHM; CANDIDATE SETS; DISTRIBUTED ANTS; DISTRIBUTED SYSTEMS; LOCAL KNOWLEDGE; MAXIMUM CLIQUE; OPTIMAL SOLUTIONS;

ALGORITHMS;

EID: 33750226665     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24854-5_3     Document Type: Article

References (26)

1. R. Battiti and M. Protasi, "Reactive Local Search for Maximum Clique," Proceedings of the Workshop on Algorithm Engineering (WAE'97), Venice, G. F. Italiano and S. Orlando, Eds., Venice, Italy, 1997, pp. 74-82.
2. P. Berman and A. Pelc, "Distributed Fault Diagnosis For Multiprocessor Systems," Proceedings of the 20th Annual International Symposium on Fault-Tolerant Computing, pp. 340-346, Newcastle, UK, 1990.
3. A. Bertoni, P. Campadelli and G. Grossi, "A Discrete Neural Algorithm for the Maximum Clique Problem: Analysis and Circuit Implementation," Proceedings of the Workshop on Algorithm Engineering (WAE'97), Venice, G. F. Italiano and S. Orlando, Eds., Venice, Italy, 1997.
4. T. N. Bui and P. H. Eppley, "A Hybrid Genetic Algorithm for the Maximum Clique Problem," Proceedings of the Sixth International Conference on Genetic Algorithms (ICGA), L. Eshelman (Ed.), pp. 748-484, Morgan Kauffman Publishers, 1995.
5. T. N. Bui and C. M. Patel, "An Ant System Algorithm for Coloring Graphs," Computational Symposium on Graph Coloring and Generalizations (COLOR02), Ithaca, NY, September 2002.
6. T. N. Bui and L. C. Strite, "An Ant System Algorithm for Graph Bisection," GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, W. B. Langdon et al. (Eds.), pp. 43-51, Morgan Kauffman Publishers, 2002.
7. I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo, "The Maximum Clique Problem," D.-Z. Du and P. M. Pardalos (Eds.), Handbook of Combinatorial Optimization, 4, Kluwer Academic Publishers, Boston, MA, 1999.
8. K. Corradi and S. Szabo, "A Combinatorial Approach for Keller's Conjecture," Periodica Mathematica Hungarica, 21, pp. 95-100, 1990.
9. M. Dorigo and G. Di Caro, "The Ant Colony Optimization Meta-Heuristic," New Ideas In Optimization, D.Corne, M. Dorigo and F. Glover (Eds.), McGraw-Hill, London, pp. 11-32, 1999.
10. S. Fenet and C. Solnon "Searching for Maximum Cliques with Ant Colony Optimization," in Applications of Evolutionary Computing, Proceedings of the EvoWorkshops 2003, April 2003 Lecture Notes in Computer Science, No. 2611, Springer-Verlag, pp. 236-245
11. M. Garey and D. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
12. L. E. Gibbons, D. W. Hearn and P. M. Pardalos, "A Continuous Based Heuristic for the Maximum Clique Problem," in [14], pp. 103-124, 1996.
13. 1-ε," Acta Mathematica, 182, pp. 105-142, 1999.
14. D. S. Johnson and M. A. Trick (Editors), Cliques, Coloring and Satisfiability - Second DIMACS Implementation Challenge 1993, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Volume 26 (1996).
15. O. H. Keller, "Über die lückenlose Erfüllung des Raumes mit Würfen," Journal für die reine und angewandte Mathematik, 163, pp. 231-238, 1930.
16. J. C. Lagarias and P. W. Shor, "Keller's Cube-Tiling Conjecture Is False In High Dimensions," Bulletin of the American Mathematical Society, 27(2), pp. 279-283, 1992.
17. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes, North-Holland, Amsterdam, 1979.
18. C. Mannino and A. Sassano, "Solving Hard Set Covering Problems," Operations Research Letters, 18, pp. 1-5, 1995.
19. E. Marchiori, "Genetic, Iterated and Multistart Local Search for the Maximum Clique Problem," Applications of Evolutionary Computing, Proceedings of the EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN, Kinsale, Ireland, S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf, G.R. Raidl (Eds.), pp. 112-121, April 3-4, 2002.
20. H. Minkowski, Diophantische Approximationen, Teubner, Leipzig, 1907.
21. G. Navarro Varela and M.C. Sinclair, "Ant Colony Optimisation for Virtual-Wavelength-Path Routing and Wavelength Allocation," Proceedings of the Congress on Evolutionary Computation (CEC'99), Washington DC, July 1999.
22. O. Perron, "Über lückenlose Ausfüllung des n-dimensionalen Raumes durch kongruente Würfel," Mathematische Zeitschrift, 46, pp. 1-26, 161-180, 1940.
23. L. Sanchis and A. Jagota, "Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem," INFORMS Journal on Computing, 8(2), pp. 87-102, Spring 1996.
24. N. J. A. Sloane, "Unsolved Problems in Graph Theory Arising from the Study of Codes," Graph Theory Notes of New York, XVIII, pp. 11-20, 1989.
25. N. J. A. Sloane and F. J. MacWilliams, The Theory of Correcting Codes, North Holland, Amsterdam, 1979.
26. P. Soriano and M. Gendreau, "Tabu Search Algorithms for the Maximum Clique Problem," in [14], pp. 221-244, 1996.