2254 search results - page 13 / 451 » Computing the minimal covering set |
124
click to vote
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We develop for set cover games several general cost-sharing methods that are approximately budget-balanced, core, and/or group-strategyproof. We first study the cost sha...
113
click to vote
ICCNMC
2005
Springer
15 years 9 months ago
2005
Springer
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
136
click to vote
JACM
1998
15 years 3 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
136
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
134
click to vote
CSC
2008
15 years 5 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...