455 search results - page 11 / 91 » Approximation Algorithms for Partial Covering Problems |
133
click to vote
SIAMSC
2011
14 years 4 months ago
2011
We consider the problem of estimating the uncertainty in large-scale linear statistical inverse problems with high-dimensional parameter spaces within the framework of Bayesian inf...
LCN
2005
IEEE
15 years 3 months ago
2005
IEEE
— Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention ...
83
Voted
WEA
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...
FCT
2007
Springer
15 years 3 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
71
Voted
COCO
2006
Springer
15 years 1 months ago
2006
Springer
We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show that for any large enough p there exists a constant cp > 1 such that C...