Treewidth-pliability and PTAS for Max-CSPs

DOI10.5555/3458064.3458093MaRDI QIDQ6147278zbMATH OpenFDO

Authors Miguel Romero, Marcin Wrochna, S. Zivny

Publication date 15 January 2024

Full work available at URL https://doi.org/10.5555/3458064.3458093

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Complexity and approximability of parameterized MAX-CSPs
• Complexity and Approximability of Parameterized MAX-CSPs
• Can you beat treewidth?
• Point-width and max-CSPs

Cited in

(3)

• Strong almost finiteness
• Pliability and approximating Max-CSPs
• Parameterized approximation for maximum weight independent set of rectangles and segments

This page was built for publication: Treewidth-pliability and PTAS for Max-CSPs

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