Minimum membership covering and hitting

DOI10.1007/978-3-030-10564-8_31OpenAlexW2906258635MaRDI QIDQ5919661

Joseph S. B. Mitchell, Supantha Pandit

Publication date: 15 October 2019

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-10564-8_31

zbMATH Keywords

NP-hardstripssegmentsrectanglesdepth of a pointminimum membership set coverminimum membership hitting set

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Parameterized complexity of minimum membership dominating set

This page was built for publication: Minimum membership covering and hitting