On MAX-SAT with cardinality constraint
From MaRDI portal
Publication:6575388
DOI10.1007/978-981-97-0566-5_10MaRDI QIDQ6575388
Hannane Yaghoubizade, Fahad Panolan
Publication date: 19 July 2024
Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27) Computational aspects of satisfiability (68R07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
