Parameterized complexity of equality MinCSP

DOI10.4230/LIPICS.ESA.2023.86MaRDI QIDQ6657051zbMATH OpenFDO

Authors George Osipov, Magnus Wahlström

Publication date 6 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2023.86

zbMATH Keywords

constraint satisfactionparameterized approximationparameterized complexity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(6)

• An order out of nowhere: a new algorithm for infinite-domain CSPs
• Almost consistent systems of linear equations
• Flow-augmentation. III: Complexity dichotomy for Boolean CSPS parameterized by the number of unsatisfied constraints
• Parameterized complexity of MinCSP over the point algebra
• Temporal valued constraint satisfaction problems
• Parameterized approximability for modular linear equations

This page was built for publication: Parameterized complexity of equality MinCSP

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