43 search results - page 2 / 9 » Vertex Cover in Graphs with Locally Few Colors |
CEC
2008
IEEE
14 years 25 days 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...
LATIN
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
DAM
2011
13 years 1 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
ISTCS
1993
Springer
13 years 10 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...
COMBINATORICS
2006
13 years 6 months ago
2006
We prove that n+h 4 vertex guards are always sufficient to see the entire interior of an n-vertex orthogonal polygon P with an arbitrary number h of holes provided that there exis...