On MAX-SAT with cardinality constraint
From MaRDI portal
Publication:6652473
DOI10.1016/j.tcs.2024.114971MaRDI QIDQ6652473
Fahad Panolan, Hannane Yaghoubizade
Publication date: 12 December 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Could not fetch data.
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Max NP-completeness made easy
- Computer science -- theory and applications. 17th international computer science symposium in Russia, CSR 2022, virtual event, June 29 -- July 1, 2022. Proceedings
- A threshold of ln n for approximating set cover
- Approximation algorithms for NP-complete problems on planar graphs
- Kernelization
- Lossy kernelization
- Tight Running Time Lower Bounds for Strong Inapproximability of Maximum k-Coverage, Unique Set Cover and Related Problems (via t-Wise Agreement Testing Theorem)
- Parameterized Algorithms
- Algorithms - ESA 2003
- Best possible approximation algorithm for MAX SAT with cardinality constraint.
- Parameterized approximation scheme for biclique-free max \(k\)-weight SAT and max coverage
- A note on max \(k\)-vertex cover: faster FPT-AS, smaller approximate kernel and improved approximation
This page was built for publication: On MAX-SAT with cardinality constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652473)
