List homomorphisms to reflexive graphs
Journal of Combinatorial Theory Series B
Approximation results for the optimum cost chromatic partition problem
Journal of Algorithms
Minimizing Average Completion of Dedicated Tasks and Interval Graphs
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
A dichotomy for minimum cost graph homomorphisms
European Journal of Combinatorics
Coloring of trees with minimum sum of colors
Journal of Graph Theory
Bi-arc graphs and the complexity of list homomorphisms
Journal of Graph Theory
Interval bigraphs and circular arc graphs
Journal of Graph Theory
Communication: Level of repair analysis and minimum cost homomorphisms of graphs
Discrete Applied Mathematics
Minimum cost homomorphisms to reflexive digraphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
SIAM Journal on Discrete Mathematics
The dichotomy of list homomorphisms for digraphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
Discrete Applied Mathematics
On the approximation of minimum cost homomorphism to bipartite graphs
Discrete Applied Mathematics
Hi-index | 0.00 |
Let H be a fixed graph without loops. We prove that if H is a co-circular arc bigraph then the minimum cost homomorphism problem to H admits a polynomial time constant ratio approximation algorithm; otherwise the minimum cost homomorphism problem to H is known to be not approximable. This solves a problem posed in an earlier paper. For the purposes of the approximation, we provide a new characterization of co-circular arc bigraphs by the existence of min ordering. Our algorithm is then obtained by derandomizing a two-phase randomized procedure. We show a similar result for graphs H in which all vertices have loops: if H is an interval graph, then the minimum cost homomorphism problem to H admits a polynomial time constant ratio approximation algorithm, and otherwise the minimum cost homomorphism problem to H is not approximable.