Extensions of the Minimum Cost Homomorphism Problem

DOI10.1007/978-3-642-14031-0_36zbMath1286.68245arXiv1210.2260OpenAlexW1770083264MaRDI QIDQ3578332

Rustem Takhanov

Publication date: 20 July 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.2260

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

Necessary Conditions for Tractability of Valued CSPs ⋮ Binarisation for Valued Constraint Satisfaction Problems ⋮ The Complexity of Valued CSPs ⋮ Unnamed Item

This page was built for publication: Extensions of the Minimum Cost Homomorphism Problem