论文信息 - Approximating maximum weight K-colorable subgraphs in chordal graphs

Approximating maximum weight K-colorable subgraphs in chordal graphs

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.

Sambuddha Roy | Venkatesan T. Chakaravarthy | Sambuddha Roy

[1] David Zuckerman,et al. Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[2] Jens Palsberg,et al. Register Allocation via Coloring of Chordal Graphs , 2005, APLAS.

[3] Reuven Bar-Yehuda,et al. A unified approach to approximating resource allocation and scheduling , 2000, STOC '00.

[4] M. Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[5] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .

[6] Sebastian Hack,et al. Interference Graphs of Programs in SSA-form , 2005 .

[7] Mihalis Yannakakis,et al. The Maximum k-Colorable Subgraph Problem for Chordal Graphs , 1987, Inf. Process. Lett..

[8] Piotr Berman,et al. Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling , 2000, J. Comb. Optim..

[9] Errol L. Lloyd,et al. on the K-coloring of Intervals , 1991, Discrete Applied Mathematics.

[10] Robert E. Tarjan,et al. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[11] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..