๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem

โœ Scribed by Stefan Kratsch, Frank Neumann

Book ID
120909995
Publisher
Springer
Year
2012
Tongue
English
Weight
581 KB
Volume
65
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An improved fixed-parameter algorithm fo
An improved fixed-parameter algorithm for vertex cover
โœ R. Balasubramanian; Michael R. Fellows; Venkatesh Raman ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 546 KB

The VERTEX COVER problem asks, for input consisting of a graph G on n vertices, and a positive integer k, whether there is a set of k vertices such that every edge of G is incident with at least one of these vertices. We give an algorithm for this problem that runs in time O(kn + (1.324718)'k'). In