50 search results - page 1 / 10 » Kernelization Algorithms for the Vertex Cover Problem: Theor... |
ALENEX
2004
14 years 12 days ago
2004
d Abstract) Faisal N. Abu-Khzam , Rebecca L. Collins , Michael R. Fellows , Michael A. Langston , W. Henry Suters and Chris T. Symons
GECCO
2009
Springer
14 years 5 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
PODC
2009
ACM
14 years 11 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
COR
2006
13 years 11 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
ANTSW
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...