1046 search results - page 61 / 210 » Approximation Algorithms for Domination Search |
127
click to vote
MFCS
2009
Springer
15 years 5 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
EOR
2002
15 years 8 days ago
2002
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
100
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
112
Voted
JUCS
2008
14 years 12 months ago
2008
: Search engines--"web dragons"--are the portals through which we access society's treasure trove of information. They do not publish the algorithms they use to sort...
110
click to vote
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...