Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Araujo, J., Bermond, J.-C., Giroire, F., Havet, F., Mazauric, D., Modrzejewski, R.: Weighted improper colouring. Journal of Discrete Algorithms 16, 53–66 (2012)
2. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. In: FOCS, pp. 14–23 (1992)
3. Bang-Jensen, J., Halldórsson, M.M.: A note on vertex coloring edge-weighted digraphs. Preprints on graph, hypergraphs and computing, Institute Mittag-Leffler (2014)
4. Berger, B., Rompel, J.: A better performance guarantee for approximate graph coloring. Algorithmica 5(4), 459–466 (1990)
5. Blum, A., Karger, D.: An
$\tilde O(n^{3/14})$
-coloring algorithm for 3-colorable graphs. Information Processing Letters 61(1), 49–53 (1997)