Fixed-parameter tractability of almost CSP problem with decisive relations

DOI10.1007/978-3-642-29700-7_21MaRDI QIDQ2897997zbMATH OpenOpenAlexFDO

Authors Chihao Zhang, Hongyang Zhang

Publication date 16 July 2012

Published in Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29700-7_21

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Almost 2-SAT is fixed-parameter tractable
• Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
• Parameterized complexity of constraint satisfaction problems
• Fixed-parameter Approximability of Boolean MinCSPs
• Constraint satisfaction parameterized by solution size

Cited in

(2)

• Almost 2-SAT is fixed-parameter tractable
• Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)

This page was built for publication: Fixed-parameter tractability of almost CSP problem with decisive relations

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