A grouping genetic algorithm for coloring the edges of graphs

Proceedings of the ACM Symposium on Applied Computing

Volumn 1, Issue , 2000, Pages 422-427

  Khuri, Sami ^a   Walters, Tim ^b   Sugono, Yanti ^c  

^a SAN JOSE STATE UNIVERSITY   (United States)

^b Virage Inc   (United States)

^c NONE   (United States)

Author keywords

Combinatorial optimization; Edge coloring problem; Genetic algorithms; Grouping genetic algorithm

Indexed keywords

APPROXIMATION ALGORITHMS; COLOR; COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; GRAPH THEORY; HEURISTIC ALGORITHMS; HEURISTIC METHODS;

BIPARTITE GRAPHS; EDGE COLORING PROBLEMS; EXACT ALGORITHMS; GREEDY ALGORITHMS; GREEDY HEURISTICS; GROUPING GENETIC ALGORITHMS; HEURISTIC TECHNIQUES; PROBLEM INSTANCES;

COLORING;

EID: 0347690643     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335603.335880     Document Type: Conference Paper

References (16)

1. Bäck, T., Schütz, M., and Khuri, S. "A comparative study of a penalty function, a repair heuristic, and stochastic operators with the set-covering problem", Artificial Evolution: Lecture Notes in Computer Science, vol. 1063, Springer Verlag, Berlin, pp. 320-332, 1996.
2. Bondy J.A. and Murty, U.S.R. Graph Theory with Applications, McMillan, New York, 1976.
3. Corcoran, A. and Wainwright, R. "LibGA: A user-friendly workbench for ordered-based genetic algorithm research", Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing, ACM Press, pp. 111-117, 1993.
4. DIMACS: Center for Discrete Mathematics and Theoretical Computer Science. ftp://dimacs.rutgers.edu/pub/challenge/graph/benchmarks/color". 1990.
5. Eiben, A. and van Hemert, J.I. "SAW-ing EAs: Adapting the fitness function for solving constrained problems", New Methods in Optimisation. Advanced Topics in Computing. McGraw-Hill, 1999.
6. Falkenauer, E. "A new representation and operators for genetic algorithms applied to grouping problems," Evolutionary Computation, pp. 123-114. The MIT Press, Massachusetts, 1994.
7. Fiorini, S. and Wilson, R.J. Edge-Colourings of Graphs. Pitman, London, 1977.
8. Hochbaum, D., editor. Approximation algorithms for NP-hard problems, PWS Press, Boston, MA, 1997.
9. Holyer, I. "The NP-completeness of edge coloring," SIAM Journal of Computing, vol. 10, pp. 718-720, 1980.
10. nd ACM Computer Science Conference, pp. 66-73, ACM Press, 1994.
11. Khuri, S. and Chiu, T. "Heuristic algorithms for the terminal assignment problem," Proceedings of the 1997 ACM Symposium on Applied Computing, pp. 247-251, ACM Press, 1997.
12. Knuth, D. The Stanford GraphBase: A Platform for Combinatorial Computing, ACM Press, NY, 1993.
13. Nishizeki, T. and Kashiwagi, K. "On the 1.1 edge-coloring of multigraphs," SIAM Journal of Discrete Mathematics, vol. 3, pp. 391-410, 1990.
14. Ramaswami, R. "Multiwavelength lightwave networks for computer communications," IEEE Communications, vol. 21, no. 2, pp. 78-88, 1993.
15. Stinson, D. An Introduction to the Design and Analysis of Algorithms, The Charles Babbage Research Center, Manitoba, Canada. 2nd edition, 1987.
16. Vizing, V. "On an estimate of the chromatic class of a p-graph" (in Russian). Diskret. Analiz., vol. 3, pp. 25-30, 1964.