A DSATUR-based algorithm for the Equitable Coloring Problem

被引：12
|
作者：
Mendez-Diaz, Isabel [1 ]
Nasini, Graciela [2 ,3 ]
Severin, Daniel [2 ,3 ]
机构：
[1] Univ Buenos Aires, FCEyN, Dept Ciencias Computac, RA-2160 Buenos Aires, DF, Argentina
[2] Univ Nacl Rosario, FCEIA, RA-2000 Rosario, Santa Fe, Argentina
[3] Consejo Nacl Invest Cient & Tecn, RA-1033 Buenos Aires, DF, Argentina
来源：
COMPUTERS & OPERATIONS RESEARCH | 2015年 / 57卷
关键词：
Equitable coloring; DSATUR; Exact algorithm; CUT ALGORITHM; REPRESENTATIVES; FORMULATION; GRAPHS;
D O I：
10.1016/j.cor.2014.11.014
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This paper describes a new exact algorithm for the Equitable Coloring Problem, a coloring problem where the sizes of two arbitrary color classes differ in at most one unit. Based on the well known DSATUR algorithm for the classic Coloring Problem, a pruning criterion arising from equity constraints is proposed and analyzed. The good performance of the algorithm is shown through computational experiments over random and benchmark instances. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码：41 / 50
页数：10
相关论文
共 50 条
  • [1] A new DSATUR-based algorithm for exact vertex coloring
    San Segundo, Pablo
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (07) : 1724 - 1733
  • [2] An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
    Furini, Fabio
    Gabrel, Virginie
    Ternier, Ian-Christopher
    [J]. NETWORKS, 2017, 69 (01) : 124 - 141
  • [3] Matheuristic Variants of DSATUR for the Vertex Coloring Problem
    Dupin, Nicolas
    [J]. METAHEURISTICS, MIC 2024, PT II, 2024, 14754 : 96 - 111
  • [4] An improved algorithm for the nearly equitable edge-coloring problem
    Xie, XZ
    Ono, T
    Nakano, S
    Hirata, T
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2004, E87A (05): : 1029 - 1033
  • [5] A fast algorithm for equitable coloring
    Henry A. Kierstead
    Alexandr V. Kostochka
    Marcelo Mydlarz
    Endre Szemerédi
    [J]. Combinatorica, 2010, 30 : 217 - 224
  • [6] A FAST ALGORITHM FOR EQUITABLE COLORING
    Kierstead, Henry A.
    Kostochka, Alexandr V.
    Mydlarz, Marcelo
    Szemeredi, Endre
    [J]. COMBINATORICA, 2010, 30 (02) : 217 - 224
  • [7] Memetic search for the equitable coloring problem
    Sun, Wen
    Hao, Jin-Kao
    Wang, Wenyu
    Wu, Qinghua
    [J]. KNOWLEDGE-BASED SYSTEMS, 2020, 188
  • [8] A polyhedral approach for the equitable coloring problem
    Mendez-Diaz, Isabel
    Nasini, Graciela
    Severin, Daniel
    [J]. DISCRETE APPLIED MATHEMATICS, 2014, 164 : 413 - 426
  • [9] A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives
    Bahiense, Laura
    Frota, Yuri
    Noronha, Thiago F.
    Ribeiro, Celso C.
    [J]. DISCRETE APPLIED MATHEMATICS, 2014, 164 : 34 - 46
  • [10] New bounds for the nearly equitable edge coloring problem
    Xie, Xuzhen
    Yagiura, Mutsunori
    Ono, Takao
    Hirata, Tomio
    Zwick, Uri
    [J]. ALGORITHMS AND COMPUTATION, 2007, 4835 : 280 - +
12345