188 search results - page 16 / 38 » Evolutionary Algorithms for Vertex Cover |
75
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. ...
TCS
2008
14 years 11 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
107
click to vote
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
105
click to vote
AAAI
2012
13 years 2 months ago
2012
In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable sol...
115
click to vote
SAC
2003
ACM
15 years 5 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...