Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs.

WADS（2023）

引用 0|浏览2

暂无评分

摘要

We give a ( 1.796 + ϵ ) -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 PTAS for the maximum k -colorable subgraph problem in chordal graphs.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要