Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment
Eden Chlamt\'a\v{c}, Yury Makarychev, Ali Vakilian

TL;DR
This paper introduces improved approximation algorithms for Red-Blue Set Cover and Minimum Monotone Satisfying Assignment problems, along with new lower bounds and hardness results, advancing the understanding of these computational challenges.
Contribution
It presents the first improved approximation algorithms for MMSA$_t$ with circuit depth $t eq 2$, and enhances the approximation for Red-Blue Set Cover, also providing new hardness and integrality gap results.
Findings
Red-Blue Set Cover approximation improved to $ ilde O(m^{1/3})$
MMSA$_t$ approximation achieved with $ ilde O(N^{1-rac{1}{3}2^{3-rac{t}{2}}})$
Lower bounds established via reductions and integrality gap analysis
Abstract
We provide new approximation algorithms for the Red-Blue Set Cover and Circuit Minimum Monotone Satisfying Assignment (MMSA) problems. Our algorithm for Red-Blue Set Cover achieves -approximation improving on the -approximation due to Elkin and Peleg (where is the number of sets). Our approximation algorithm for MMSA (for circuits of depth ) gives an approximation for , where is the number of gates and variables. No non-trivial approximation algorithms for MMSA with were previously known. We complement these results with lower bounds for these problems: For Red-Blue Set Cover, we provide a nearly approximation preserving reduction from Min -Union that gives an hardness under the Dense-vs-Random conjecture,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
