1389 search results - page 57 / 278 » Improved Approximation Algorithms for Label Cover Problems |
141
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
130
click to vote
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
168
Voted
WIOPT
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— An important application of wireless sensor networks is to perform the monitoring missions, for example, to monitor some targets of interests at all times. Sensors are ...
109
Voted
FAW
2008
Springer
15 years 4 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
131
Voted
SODA
2008
ACM
15 years 4 months ago
2008
ACM
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...