Oriented coloring: complexity and approximation

Authors:
Jean-François Culus;Marc Demange
Affiliations:
UTM, équipe Grimm – SMASH, Toulouse, France;département SID Avenue Bernard HIRSH, ESSEC, Cergy Pontoise, France
Venue:
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Year:
2006

Citing 9
Cited 2

On the complexity of H-coloring

Journal of Combinatorial Theory Series B
A still better performance guarantee for approximate graph coloring

Information Processing Letters
Maximizing the number of unused colors in the vertex coloring problem

Information Processing Letters
Approximation of k-set cover by semi-local optimization

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Differential approximation algorithms for some combinatorial optimization problems

Theoretical Computer Science
Oriented graph coloring

Discrete Mathematics
z-Approximations

Journal of Algorithms
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Digraph width measures in parameterized algorithmics

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.