4255 search results - page 27 / 851 » Cover |
146
click to vote
HEURISTICS
1998
15 years 1 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
134
click to vote
SWAT
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...
123
click to vote
JSYML
2010
14 years 8 months ago
2010
Abstract. Building on Hrushovski's work in [5], we study definable groupoids in stable theories and their relationship with 3-uniqueness and finite internal covers. We introdu...
139
click to vote
WDAG
2009
Springer
15 years 8 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
106
click to vote
ECML
2005
Springer
15 years 7 months ago
2005
Springer
We propose a new learning algorithm for the set covering machine and a tight data-compression risk bound that the learner can use for choosing the appropriate tradeoff between the ...