On the approximation of minimum cost homomorphism to bipartite graphs

DOI10.1016/j.dam.2011.05.002zbMath1258.68185OpenAlexW2166143359MaRDI QIDQ1941394

Monaldo Mastrolilli, Arash Rafiey

Publication date: 12 March 2013

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.05.002

zbMATH Keywords

approximation algorithmminimum cost homomorphismmin-max ordering

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Unnamed Item

This page was built for publication: On the approximation of minimum cost homomorphism to bipartite graphs