1040 search results - page 33 / 208 » Rounding algorithms for covering problems |
ADMA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Crawling the deep web often requires the selection of an appropriate set of queries so that they can cover most of the documents in the data source with low cost. This ca...
STACS
2005
Springer
14 years 2 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
VLSID
2007
IEEE
14 years 9 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
KI
2007
Springer
14 years 2 months ago
2007
Springer
We introduce a novel stochastic local search algorithm for the vertex cover problem. Compared to current exhaustive search techniques, our algorithm achieves excellent performance ...
DC
2011
12 years 8 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...