Conflict-free covering

Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S.B. Mitchell, Marina Simakov

Research output: Contribution to conferencePaperpeer-review

17 Scopus citations

Abstract

Let P = {C1,C2, . ,Cn} be a set of color classes, where each color class Ci consists of a set of points. In this paper, we address a family of covering problems, in which one is allowed to cover at most one point from each color class. We prove that the problems in this family are NPcomplete (or NP-hard) and offer several constant-factor approximation algorithms.

Original languageEnglish
Pages17-22
Number of pages6
StatePublished - 1 Jan 2015
Event27th Canadian Conference on Computational Geometry, CCCG 2015 - Kingston, Canada
Duration: 10 Aug 201512 Aug 2015

Conference

Conference27th Canadian Conference on Computational Geometry, CCCG 2015
Country/TerritoryCanada
CityKingston
Period10/08/1512/08/15

Fingerprint

Dive into the research topics of 'Conflict-free covering'. Together they form a unique fingerprint.

Cite this