Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > UNIQUE COVERAGE:
Reports tagged with unique coverage:
TR15-155 | 22nd September 2015
Venkatesan Guruswami, Euiwoong Lee

#### Nearly Optimal NP-Hardness of Unique Coverage

The {\em Unique Coverage} problem, given a universe $V$ of elements and a collection $E$ of subsets of $V$, asks to find $S \subseteq V$ to maximize the number of $e \in E$ that intersects $S$ in {\em exactly one} element. When each $e \in E$ has cardinality at most ... more >>>

ISSN 1433-8092 | Imprint