1536 search results - page 6 / 308 » Approximately Dominating Representatives |
DAM
2006
13 years 7 months ago
2006
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...
ER
2005
Springer
14 years 1 months ago
2005
Springer
The idea of Conceptual Neighbourhood Diagram (CND) has proved its relevance in the areas of qualitative reasoning about time and qualitative reasoning about space. In this work, a ...
ALGORITHMICA
2006
13 years 7 months ago
2006
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...