Conflict-free covering

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

Conflict-free covering

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

Department of Computer Science

Ben-Gurion University of the Negev

Research output: Contribution to conference › Paper › peer-review

Abstract

Let P = {C₁,C₂, . ,C_n} 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 language	American English
Pages	17-22
Number of pages	6
State	Published - 1 Jan 2015
Event	27th Canadian Conference on Computational Geometry, CCCG 2015 - Kingston, Canada Duration: 10 Aug 2015 → 12 Aug 2015

Conference

Conference	27th Canadian Conference on Computational Geometry, CCCG 2015
Country/Territory	Canada
City	Kingston
Period	10/08/15 → 12/08/15

All Science Journal Classification (ASJC) codes

Geometry and Topology
Computational Mathematics

Cite this

@conference{13d3556d220c4427b5f58dae3cc7dc54,

title = "Conflict-free covering",

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.",

author = "Arkin, {Esther M.} and Aritra Banik and Paz Carmi and Gui Citovsky and Katz, {Matthew J.} and Mitchell, {Joseph S.B.} and Marina Simakov",

note = "Publisher Copyright: {\textcopyright} 2015 Queen's University Ontario Canada. All rights reserved.; 27th Canadian Conference on Computational Geometry, CCCG 2015 ; Conference date: 10-08-2015 Through 12-08-2015",

year = "2015",

month = jan,

day = "1",

language = "American English",

pages = "17--22",

}

TY - CONF

T1 - Conflict-free covering

AU - Arkin, Esther M.

AU - Banik, Aritra

AU - Carmi, Paz

AU - Citovsky, Gui

AU - Katz, Matthew J.

AU - Mitchell, Joseph S.B.

AU - Simakov, Marina

PY - 2015/1/1

Y1 - 2015/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85025138906&partnerID=8YFLogxK

M3 - Paper

SP - 17

EP - 22

T2 - 27th Canadian Conference on Computational Geometry, CCCG 2015

Y2 - 10 August 2015 through 12 August 2015

ER -

Conflict-free covering

Abstract

Conference

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this