1671 search results - page 36 / 335 » On the Covering Steiner Problem |
CEC
2008
IEEE
14 years 5 months ago
2008
IEEE
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
COMBINATORICS
2006
13 years 11 months ago
2006
Consider the symmetric group Sn equipped with the Hamming metric dH . Packing and covering problems in the finite metric space (Sn, dH ) are surveyed, including a combination of b...
ICALP
2010
Springer
14 years 3 months ago
2010
Springer
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
ANTSW
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
DAM
2008
13 years 11 months ago
2008
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown r...