Abstract
This paper is devoted to an oriented coloring problem motivated by a task assignment model. A recent result established the NP-completeness of deciding whether a digraph is k-oriented colorable; we extend this result to the classes of bipartite digraphs and circuit-free digraphs. Finally, we investigate the approximation of this problem: both positive and negative results are devised.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Demange, M., Ekim, T., de Werra, D.: On the Approximation of Min Split-Coloring and Min Cocoloring (manuscript)
Demange, M., Grisoni, P., Paschos, V.T.: Differential Approximation Algorithms for Some Combinatorial Optimization Problems. Theoretical Computer Science 209, 107–122 (1998)
Duh, R., Fürer, M.: Approximation of k-Set Cover by Semi-Local Optimization. In: Proc. of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 256–264 (1997)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York
Halldórsson, M.M.: A Still Better Performance Quarantee for Approximate Graph Coloring. Information Processing Letters 45, 19–23 (1993)
Hassin, R., Khuller, S.: z-Approximations. Journal of Algorithms 41, 429–442 (2001)
Hassin, R., Lahav, S.: Maximizing the Number of Unused Colors in the Vertex Coloring Problem. Information Processing Letters 52, 87–90 (1994)
Hell, P., Nesetril, J.: On the Complexity of h-Coloring. Journal of Combinatorial Theory (B) 18, 92–110 (1990)
Hell, P., Nesetril, J.: Graphs and Homomorphisms. Oxford Lecture Series in Mathematics and its Applications (2004)
Johnson, D.S.: Approximation Algorithms for Combinatorial Problems. Journal of Computer and System Sciences 9, 256–278 (1974)
Kierstead, H.A., Trotter, W.T.: Competitive Colorings of Oriented Graphs. Electronic Journal of Combinatorics 8 (2001)
Klostermeyer, W.F., MacGillivray, G.: Homomorphisms and Oriented Colorings of Equivalence Classes of Oriented Graphs. Discrete Mathematics 274, 161–172 (2004)
Nesetril, J., Sopena, E.: On the Oriented Game Chromatic Number. The Electronic Journal of Combinatorics 8(2), R14 (2001)
Nesetril, J., Sopena, E., Vignal, L.: t-Preserving Homomorphisms of Oriented Graphs. Comment. Math. Univ. Carolinae 38(1), 125–136 (1997)
Sopena, E.: Computing Chromatic Polynomials of Oriented Graphs. In: Proc. Formal power series and Algebraic Combinatorics. DIMACS, pp. 413–422 (1994)
Sopena, E.: Oriented Graph Coloring. Discrete Mathematics 229 (2001)
Wood, D.R.: Acyclic, Star and Oriented Colorings of Graph Subdivisions (2005) (submitted)
Zemel, E.: Measuring the Quality of Approximate Solutions to Zero-One Programming Problems. Mathematics of Operations Research 6, 319–332 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Culus, JF., Demange, M. (2006). Oriented Coloring: Complexity and Approximation. In: Wiedermann, J., Tel, G., Pokorný, J., Bieliková, M., Štuller, J. (eds) SOFSEM 2006: Theory and Practice of Computer Science. SOFSEM 2006. Lecture Notes in Computer Science, vol 3831. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11611257_20
Download citation
DOI: https://doi.org/10.1007/11611257_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31198-0
Online ISBN: 978-3-540-32217-7
eBook Packages: Computer ScienceComputer Science (R0)