An FPT-time O(2^k log n)-approximation is given for k-MMSA_3, alongside gap-preserving reductions clarifying inapproximability across the MMSA hierarchy.
40th Annual Symposium on Foundations of Computer Science,
1 Pith paper cite this work, alongside 24 external citations. Polarity classification is still indexing.
1
Pith paper citing it
24
external citations · external index
fields
cs.CC 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
On the Approximability of Parameterized Minimum Monotone Satisfying Assignment
An FPT-time O(2^k log n)-approximation is given for k-MMSA_3, alongside gap-preserving reductions clarifying inapproximability across the MMSA hierarchy.