@InProceedings{chlamtac_et_al:LIPIcs.APPROX/RANDOM.2023.11,
author = {Chlamt\'{a}\v{c}, Eden and Makarychev, Yury and Vakilian, Ali},
title = {{Approximating Red-Blue Set Cover and Minimum Monotone Satisfying Assignment}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {11:1--11:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.11},
URN = {urn:nbn:de:0030-drops-188366},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.11},
annote = {Keywords: Red-Blue Set Cover Problem, Circuit Minimum Monotone Satisfying Assignment (MMSA) Problem, LP Rounding}
}