Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909232365830144 |
|---|---|
| author | DeHaan, Ian Friggstad, Zachary |
| author_facet | DeHaan, Ian Friggstad, Zachary |
| contents | 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 polynomial-time approximation scheme for the maximum $k$-colorable subgraph problem in chordal graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_18835 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs DeHaan, Ian Friggstad, Zachary Data Structures and Algorithms F.2.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 polynomial-time approximation scheme for the maximum $k$-colorable subgraph problem in chordal graphs. |
| title | Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs |
| topic | Data Structures and Algorithms F.2.2 |
| url | https://arxiv.org/abs/2406.18835 |