{"paper":{"title":"Multivariate Complexity Analysis of Geometric {\\sc Red Blue Set Cover}","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pradeesha Ashok, Saket Saurabh, Sudeshna Kolay","submitted_at":"2015-11-24T10:53:03Z","abstract_excerpt":"We investigate the parameterized complexity of GENERALIZED RED BLUE SET COVER (Gen-RBSC), a generalization of the classic SET COVER problem and the more recently studied RED BLUE SET COVER problem. Given a universe $U$ containing $b$ blue elements and $r$ red elements, positive integers $k_\\ell$ and $k_r$, and a family $\\F$ of $\\ell$ sets over $U$, the \\srbsc\\ problem is to decide whether there is a subfamily $\\F'\\subseteq \\F$ of size at most $k_\\ell$ that covers all blue elements, but at most $k_r$ of the red elements. This generalizes SET COVER and thus in full generality it is intractable i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07642","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}