Weighted Coloring in Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Weighted Coloring in Trees

Abstract

A proper coloring of a graph is a partition of its vertex set into stable sets, where each part corresponds to a color. For a vertex-weighted graph, the weight of a color is the maximum weight of its vertices. The weight of a coloring is the sum of the weights of its colors. Guan and Zhu defined the weighted chromatic number of a vertex-weighted graph G as the smallest weight of a proper coloring of G (1997). If vertices of a graph have weight 1, its weighted chromatic number coincides with its chromatic number. Thus, the problem of computing the weighted chromatic number, a.k.a. Max Coloring Problem, is NP-hard in general graphs. It remains NP-hard in some graph classes as bipartite graphs. Approximation algorithms have been designed in several graph classes, in particular, there exists a PTAS for trees. Surprisingly, the time-complexity of computing this parameter in trees is still open. The Exponential Time Hypothesis (ETH) states that 3-SAT cannot be solved in sub-exponential time. We show that, assuming ETH, the best algorithm to compute the weighted chromatic number of n-node trees has time-complexity n (log n). Our result mainly relies on proving that, when computing an optimal proper weighted coloring of a graph G, it is hard to combine colorings of its connected components.
Fichier principal
Vignette du fichier
STACS14.pdf (285.71 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00931523 , version 1 (15-01-2014)

Identifiers

  • HAL Id : hal-00931523 , version 1

Cite

Julio Araújo, Nicolas Nisse, Stéphane Pérennes. Weighted Coloring in Trees. 31st Symposium on Theoretical Aspects of Computer Science (STACS), Mar 2014, Lyon, France. pp.75-86. ⟨hal-00931523⟩
220 View
115 Download

Share

Gmail Mastodon Facebook X LinkedIn More