TY - GEN

T1 - The set cover with pairs problem

AU - Hassin, Refael

AU - Segev, Danny

PY - 2005

Y1 - 2005

N2 - We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects that induces a collection of pairs covering all elements. Formally, let U be a ground set of elements and let S be a set of objects, where each object i has a non-negative cost wi. For every {i, j} ⊆ S, let C(i, j) be the collection of elements in U covered by the pair {i, j}. The set cover with pairs problem asks to find a subset A ⊆ S such that U{i, j}⊆A C(i, j) = U and such that ∑ i∈A wi minimized. In addition to studying this general problem, we are also concerned with developing polynomial time approximation algorithms for interesting special cases. The problems we consider in this framework arise in the context of domination in metric spaces and separation of point sets.

AB - We consider a generalization of the set cover problem, in which elements are covered by pairs of objects, and we are required to find a minimum cost subset of objects that induces a collection of pairs covering all elements. Formally, let U be a ground set of elements and let S be a set of objects, where each object i has a non-negative cost wi. For every {i, j} ⊆ S, let C(i, j) be the collection of elements in U covered by the pair {i, j}. The set cover with pairs problem asks to find a subset A ⊆ S such that U{i, j}⊆A C(i, j) = U and such that ∑ i∈A wi minimized. In addition to studying this general problem, we are also concerned with developing polynomial time approximation algorithms for interesting special cases. The problems we consider in this framework arise in the context of domination in metric spaces and separation of point sets.

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

U2 - 10.1007/11590156_13

DO - 10.1007/11590156_13

M3 - Conference contribution

AN - SCOPUS:33744941093

SN - 3540304959

SN - 9783540304951

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 164

EP - 176

BT - FSTTCS 2005

T2 - 25th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2005

Y2 - 15 December 2005 through 18 December 2005

ER -