166 search results - page 6 / 34 » Fixed-parameter evolutionary algorithms and the vertex cover... |
CIAC
2010
Springer
15 years 6 months ago
2010
Springer
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
WDAG
2009
Springer
15 years 4 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,...
ICCS
2003
Springer
15 years 2 months ago
2003
Springer
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
ALENEX
2004
14 years 11 months ago
2004
d Abstract) Faisal N. Abu-Khzam , Rebecca L. Collins , Michael R. Fellows , Michael A. Langston , W. Henry Suters and Chris T. Symons
ESA
2006
Springer
15 years 1 months ago
2006
Springer