Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
<|reference_start|>Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs: We give a $(1.796+\epsilon)$-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 $k$-colorable subgraph problem in chordal graphs.<|reference_end|>
@article{dehaan2024approximate,
    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},
    archivePrefix={arXiv},
    eprint={2406.18835},
    primaryClass={cs.DS}
}