On some applications of the selective graph coloring problem

European Journal of Operational Research

Volumn 240, Issue 2, 2015, Pages 307-314

  Demange, Marc ^a,d   Ekim, Tinaz ^b   Ries, Bernard ^c,d   Tanasescu, Cerasela ^a,e  

^a ESSEC BUSINESS SCHOOL   (France)

^b BOGAZICI UNIVERSITY   (Turkey)

^c UNIVERSITÉ PARIS DAUPHINE   (France)

^d CNRS   (France)

^e UNIVERSITÉ DES ANTILLES ET DE LA GUYANE   (France)

Author keywords

Combinatorial optimization; Computational complexity; Graph theory; Partition coloring; Selective coloring

Indexed keywords

COLORING; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY;

CHROMATIC NUMBER; DIFFERENT CLASS; FUTURE RESEARCH DIRECTIONS; GENERIC SITUATION; GRAPH COLORING PROBLEM; GRAPH PROBLEMS; NEW APPROACHES; UNIFIED FRAMEWORK;

GRAPH THEORY;

EID: 84922337858     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2014.05.011     Document Type: Review

References (38)

1. Archetti, C., Bianchessi, N., Hertz, A., Colombet, A., & Gagnon, F. (2013). Directed weighted improper coloring for cellular channel allocation. Discrete Applied Mathematics. http://dx.doi.org/10.1016/j.dam.2013.11.018.
2. Beauquier, B., Bermond, J. -C., Gargano, L., Hell, P., Perennes, S., & Vaccaro, U. (1997). Graph problems arising from wavelength-routing in all-optical networks. In Proceedings of the 2nd workshop on optics and computer science, 1997, Satellite of IPPS'97.
3. Bonomo, F., Cornaz, D., Ekim, T., & Ries, B. (2013). Perfectness of clustered graphs. Discrete Optimization, 10, 296-303.
4. Breu, H., & Kirkpatrick, D. G. (1998). Unit disk graph recognition is NP-hard. Computational Geometry: Theory and Applications, 9(1-2), 3-24.
5. Chudnovsky, M., & Seymour, P. (2005). The structure of claw-free graphs. Surveys in Combinatorics, London Mathematical Society Lecture Note Series, 327, 153-171.
6. Chudnovsky, M., & Seymour, P. (2012). Claw-free graphs VII. Quasi-line graphs. Journal of Combinatorial Theory Series B, 102, 1267-1294.
7. Clark, B. N., Colbourn, C. J., & Johnson, D. S. (1990). Unit disk graphs. Discrete Mathematics, 86(1-3), 165-177.
8. Couderc, O. (1998). A new paradigm for dichotomy-based constrained encoding. In Proceedings of design, automation and test in Europe (DATE), Paris.
9. Dandashi, A., & Al-Mouhamed, M. (2010). Graph Coloring for class scheduling. In Proceedings of IEEE/ACS international conference on computer systems and applications (AICCSA).
10. Demange, M., Ekim, T., & de Werra, D. (2009). A tutorial on the use of graph coloring for some problems in robotics. European Journal of Operational Research, 192(1), 41-55.
11. Demange M., Monnot J., & Ries B. (2013). Selective coloring in interval graphs. Manuscript.
12. Demange M., Ekim T., & Ries B. (2014). On minimum and maximum selective graph coloring in several graph classes. Manuscript.
13. Demange, M., Monnot, J., Petrica, P., & Ries, B. (2013). On the complexity of the selective graph coloring problem in some special classes of graphs. Theoretical Computer Science. in press, http://dx.doi.org/10.1016/j.tcs.2013.04.018.
14. Eisenblatter, A., Grotschel, M., & Koster, A. M. C. A. (2002). Frequency planning and ramifications of coloring. Discussiones Mathematicae Graph Theory, 22(1), 51-88.
15. Erlebach, T., & Jansen, K. (2001). The complexity of path coloring and call scheduling. Theoretical Computer Science, 255, 33-50.
16. Frota, Y., Maculan, N., Noronha, T. F., & Ribeiro, C. C. (2010). A branch-and-cut algorithm for partition coloring. Networks, 55(3), 194-204.
17. Gamache, M., Hertz, A., & Ouellet, J. (2007). A graph coloring model for a feasibility problem in crew scheduling. Computers and Operations Research, 34, 2384-2395.
18. Garey, M. R., Johnson, D. S., Miller, G. L., & Papadimitriou, C. H. (1980). The complexity of coloring circular arcs and chords. SIAM Journal on Algebraic and Discrete Methods, 1(2), 216-227.
19. Gavril, F. (1973). Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks, 3, 261-273.
20. Giaro, K., Kubale, M., & Obszarski, P. (2009). A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints. Discrete Applied Mathematics, 157(17), 3625-3630.
21. Golumbic, M. C. (2004). Algorithmic graph theory and perfect graphs. Computer Science and Applied Mathematics, Academic Press.
22. Graf, A., Stumpf, M., & Weisenfels, G. (1998). On coloring unit disk graphs. Algorithmica, 20(3), 277-293.
23. Guangzhi, L., & Simha, R. (2000). The partition coloring problem and its application to wavelength routing and assignment. In Proceedings of the first workshop on optical networks, Dallas.
24. Hoshino, E. A., Frota, Y., & de Souza, C. C. (2011). A branch-and-price approach for the partition coloring problem. Operations Research Letters, 39(2), 132-137.
25. Noronha, T. F., & Ribeiro, C. C. (2006). Routing and wavelength assignment by partition colouring. European Journal of Operational Research, 71(3), 797-810.
26. Peeters, R. (1991). On coloring j-unit sphere graphs. Technical Report, Tilburg University.
27. Petersen, H. L., & Madsen, O. B. G. (2009). The double traveling salesman problem with multiple stacks - Formulation and heuristic solution approaches. European Journal of Operational Research, 198(1), 139-147.
28. Qu, R., Burke, E. K., & McCollum, B. (2009). Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems. European Journal of Operational Research, 198(2), 392-404.
29. Rim, C. S., & Nakajima, K. (1995). On rectangle intersection and overlap graphs. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, 42(9), 549-553.
30. Roberts, F. S. (1969). Indifference graphs. In F. Harary (Ed.), Proof techniques in graph theory (pp. 139-146). NY: Academic Press.
31. Sotskov, Y. N., Dolgui, A., & Werner, F. (2001). Unit-time job-shop scheduling via mixed graph coloring. International Journal of Mathematical Algorithms, 2(4), 289-325.
32. Stahlbock, R., & Vos, S. (2008). Operations research at container terminals: A literature update. OR Spectrum, 30, 1-52.
33. Talavan, P. M., & Yanez, J. (2008). The graph coloring problem: A neuronal network approach. European Journal of Operational Research, 191(1), 100-111.
34. Touhami, S., Bourjolly, J.-M., & Laporte, G. (2009). Partial integration of frequency allocation within antenna positioning in GSM mobile networks. European Journal of Operational Research, 193(2), 541-551.
35. Tracey, J. H. (1966). Internal state assignments for asynchronous sequential machines. IEEE Transactions on Electronic Computers, 15(4), 551-560.
36. Turkoʇullari, Y., Taşkin, Z. C., Aras, N., & Altinel, K. (2014). Optimal berth allocation and time-invariant quay crane assignment in container terminals. European Journal of Operational Research, 235(1), 88-101.
37. Zang, H., Jue, J. P., & Mukherjee, B. (2000). A review of routing and wavelength assignment approaches for wavelength routed optical WDM networks. Optical Networks Magazine, 1(1), 47-60.
38. Zhou, Y., & Poo, G.-S. (2005). Optical multicast over wavelength-routed WDM networks: A survey. Optical Switching and Networking, 2(3), 176-197.