The complexity of general-valued CSPs

DOI10.1109/FOCS.2015.80MaRDI QIDQ6946829zbMATH OpenFDO

Authors Michal Rolínek, Vladimir Kolmogorov, Andrei Krokhin

Publication date 5 August 2025

Full work available at URL https://durham-repository.worktribe.com/file/1385737/1/Accepted%20Journal%20Article

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Theory of computing (68Qxx)

Cited in

(2)

• On equivalence of parameterized inapproximability of \(k\)-median, \(k\)-max-coverage, and 2-CSP
• On equivalence of parameterized inapproximability of k-median, k-max-coverage, and 2-CSP

This page was built for publication: The complexity of general-valued CSPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946829)