Approximating maximum weight K-colorable subgraphs in chordal graphs

Authors:
Venkatesan T. Chakaravarthy;Sambuddha Roy
Affiliations:
IBM India Research Lab, New Delhi, India;IBM India Research Lab, New Delhi, India
Venue:
Information Processing Letters
Year:
2009

Citing 7
Cited 2

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
The maximum k-colorable subgraph problem for chordal graphs

Information Processing Letters
On the k-coloring of intervals

Discrete Applied Mathematics
A unified approach to approximating resource allocation and scheduling

Journal of the ACM (JACM)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Linear degree extractors and the inapproximability of max clique and chromatic number

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Register allocation via coloring of chordal graphs

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems

Elimination Graphs

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Elimination graphs

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present a 2-approximation algorithm for the problem of finding the maximum weight K-colorable subgraph in a given chordal graph with node weights. The running time of the algorithm is O(K(n+m)), where n and m are the number of vertices and edges in the given graph.