Approximation of minimum cost homomorphisms
From MaRDI portal
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Approximation algorithms (68W25)
Recommendations
Cited in
(15)- Ferrers dimension of grid intersection graphs
- List-homomorphism problems on graphs and arc consistency
- Interval-like graphs and digraphs
- scientific article; zbMATH DE number 7561584 (Why is no real title available?)
- Min-orderable digraphs
- Minimum violation vertex maps and their applications to cut problems
- PTAS for Sparse General-valued CSPs
- Recognizing interval bigraphs by forbidden patterns
- Min orderings and list homomorphism dichotomies for signed and unsigned graphs
- Strong Cocomparability Graphs and Slash-Free Orderings of Matrices
- Bi-arc digraphs: recognition algorithm and applications
- Min orderings and list homomorphism dichotomies for graphs and signed graphs
- List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
- Interval k-graphs : recognition and forbidden obstructions
- On the constant-factor approximability of minimum cost constraint satisfaction problems
This page was built for publication: Approximation of minimum cost homomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912876)