A GRASP for the convex recoloring problem in graphs

DOI10.1016/j.entcs.2019.08.034OpenAlexW2978062530WikidataQ113317398 ScholiaQ113317398MaRDI QIDQ2132370

Zanoni Dias, Ana Paula dos Santos Dantas, Cid Carvalho De Souza

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.034

zbMATH Keywords

combinatorial optimizationGRASPconvex recoloring

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Uses Software

• LEMON
• irace

Cites Work

• Unnamed Item
• Unnamed Item
• The convex recoloring problem: polyhedra, facets and computational experiments
• The complexity of minimum convex coloring
• Improved approximation algorithm for convex recoloring of trees
• Convex recolorings of strings and trees: Definitions, hardness results and algorithms
• An extended formulation of the convex recoloring problem on a tree
• Greedy randomized adaptive search procedures
• Partial convex recolorings of trees and galled networks

This page was built for publication: A GRASP for the convex recoloring problem in graphs