Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation

Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier. Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. In Rudolf Fleischer, Gerhard Trippen, editors, Algorithms and Computation, 15th International Symposium, ISAAC 2004, HongKong, China, December 20-22, 2004, Proceedings. Volume 3341 of Lecture Notes in Computer Science, pages 896-907, Springer, 2004. [doi]

Abstract

Abstract is missing.