Bounded max-colorings of graphs

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 (colors) 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01340674
Contributor : Lip6 Publications <>
Submitted on : Friday, July 1, 2016 - 3:40:44 PM
Last modification on : Thursday, March 21, 2019 - 1:08:14 PM

Links full text

Identifiers

Citation

Evripidis Bampis, Alexander Kononov, Giorgio Lucarelli, Ioannis Milis. Bounded max-colorings of graphs. 21st International Symposium on Algorithms and Computation (ISAAC 2010), Dec 2010, Jeju Island, South Korea. pp.353-365, ⟨10.1007/978-3-642-17517-6_32⟩. ⟨hal-01340674⟩

Share

Metrics

Record views

76