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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 2009-03, Vol.109 (7), p.365-368
Hauptverfasser: Chakaravarthy, Venkatesan T., Roy, Sambuddha
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Approximation
Approximation algorithms
Chordal graphs
Coloring
Computer science
control theory
systems
Exact sciences and technology
Graph algorithms
Graph coloring
Information retrieval. Graph
Interval graphs
Miscellaneous
Studies
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2008.12.007