Bounded max-colorings of graphs - Archive ouverte HAL Access content directly
Journal Articles Journal of Discrete Algorithms Year : 2014

Bounded max-colorings of graphs

Evripidis Bampis
  • Function : Author
  • PersonId : 855947
Alexander Kononov
  • Function : Author
Giorgio Lucarelli
Ioannis Milis
  • Function : Author

Abstract

In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at most b and of weight equal to the weight of the heaviest vertex/edge in this class. The bounded max-vertex/edge-coloring problems ask for such a coloring minimizing the sum of all color classes' weights. These problems generalize the well known max-coloring problems by taking into account the number of available resources (i.e., the cardinality of color classes) in practical applications. In this paper we present complexity results and approximation algorithms for the bounded max-coloring problems on general graphs, bipartite graphs and trees.

Dates and versions

hal-01185103 , version 1 (19-08-2015)

Identifiers

Cite

Evripidis Bampis, Alexander Kononov, Giorgio Lucarelli, Ioannis Milis. Bounded max-colorings of graphs. Journal of Discrete Algorithms, 2014, 26, pp.56-68. ⟨10.1016/j.jda.2013.11.003⟩. ⟨hal-01185103⟩
61 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More