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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Culus, J. F., & Démange, M. (2006). Oriented coloring: Complexity and approximation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3831 LNCS, pp. 226–236). https://doi.org/10.1007/11611257_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
