Mezei, Balázs F.; Wrochna, Marcin; Živný, Stanislav PTAS for sparse general-valued CSPs. (English) Zbl 07753165 ACM Trans. Algorithms 19, No. 2, Article No. 14, 31 p. (2023). MSC: 68-XX PDFBibTeX XMLCite \textit{B. F. Mezei} et al., ACM Trans. Algorithms 19, No. 2, Article No. 14, 31 p. (2023; Zbl 07753165) Full Text: DOI arXiv
Kawarabayashi, Ken-ichi; Xu, Chao Minimum violation vertex maps and their applications to cut problems. (English) Zbl 1453.05072 SIAM J. Discrete Math. 34, No. 4, 2183-2207 (2020). MSC: 05C60 05C75 05C85 05C20 PDFBibTeX XMLCite \textit{K.-i. Kawarabayashi} and \textit{C. Xu}, SIAM J. Discrete Math. 34, No. 4, 2183--2207 (2020; Zbl 1453.05072) Full Text: DOI
Rafiey, Akbar; Rafiey, Arash; Santos, Thiago Toward a dichotomy for approximation of \(H\)-coloring. (English) Zbl 07561584 Baier, Christel (ed.) et al., 46th international colloquium on automata, languages, and programming, ICALP 2019, Patras, Greece, July 9–12, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 132, Article 91, 16 p. (2019). MSC: 68Nxx 68Qxx PDFBibTeX XMLCite \textit{A. Rafiey} et al., LIPIcs -- Leibniz Int. Proc. Inform. 132, Article 91, 16 p. (2019; Zbl 07561584) Full Text: DOI arXiv
Krokhin, Andrei; Zivny, Stanislav The complexity of valued CSPs. (English) Zbl 1482.68165 Krokhin, Andrei (ed.) et al., The constraint satisfaction problem: complexity and approximability, Dagstuhl seminar 15301, July 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. Dagstuhl Follow-Ups 7, 233-266 (2017). MSC: 68R07 68Q25 68Q27 90C27 PDFBibTeX XMLCite \textit{A. Krokhin} and \textit{S. Zivny}, Dagstuhl Follow-Ups 7, 233--266 (2017; Zbl 1482.68165) Full Text: DOI
Cohen, David A.; Cooper, Martin C.; Jeavons, Peter G.; Krokhin, Andrei; Powell, Robert; Živný, Stanislav Binarisation for valued constraint satisfaction problems. (English) Zbl 1477.68121 SIAM J. Discrete Math. 31, No. 4, 2279-2300 (2017). MSC: 68Q25 08A70 68Q17 PDFBibTeX XMLCite \textit{D. A. Cohen} et al., SIAM J. Discrete Math. 31, No. 4, 2279--2300 (2017; Zbl 1477.68121) Full Text: DOI arXiv
Hell, Pavol; Nevisi, Mayssam Mohammadi Minimum cost homomorphisms with constrained costs. (English) Zbl 1476.68110 Dinh, Thang N. (ed.) et al., Computing and combinatorics. 22nd international conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2–4, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9797, 194-206 (2016). MSC: 68Q25 05C60 68Q17 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{M. M. Nevisi}, Lect. Notes Comput. Sci. 9797, 194--206 (2016; Zbl 1476.68110) Full Text: DOI arXiv