1040 search results - page 44 / 208 » Rounding algorithms for covering problems |
100
click to vote
EWSN
2004
Springer
15 years 9 months ago
2004
Springer
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...
IPSN
2010
Springer
15 years 4 months ago
2010
Springer
For in-network storage schemes, one maps data, indexed in a logical space, to the distributed sensor locations. When the physical sensor network has an irregular shape and possibl...
FOCS
2008
IEEE
14 years 10 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...
QSIC
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper, we consider a problem that arises in black box testing: generating small test suites (i.e., sets of test cases) where the combinations that have to be covered are s...
ESA
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...