Sciweavers

FSTTCS
2005
Springer
13 years 10 months ago
The Set Cover with Pairs Problem
Abstract. 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 th...
Refael Hassin, Danny Segev
FOCS
2008
IEEE
13 years 11 months ago
Algorithms for Single-Source Vertex Connectivity
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
Julia Chuzhoy, Sanjeev Khanna