91 search results - page 1 / 19 » A Threshold of ln n for Approximating Set Cover |
JACM
1998
13 years 4 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 ...
STACS
2005
Springer
13 years 10 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...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...