Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
Data Structures and Algorithms
2024-06-28 v1
Abstract
We give a -approximation for the minimum sum coloring problem on chordal graphs, improving over the previous 3.591-approximation by Gandhi et al. [2005]. To do so, we also design the first polynomial-time approximation scheme for the maximum -colorable subgraph problem in chordal graphs.
Keywords
Cite
@article{arxiv.2406.18835,
title = {Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs},
author = {Ian DeHaan and Zachary Friggstad},
journal= {arXiv preprint arXiv:2406.18835},
year = {2024}
}
Comments
15 pages, preliminary version appeared in the proceedings of WADS 2023