1717 search results - page 45 / 344 » On the analysis of the (1 1) memetic algorithm |
SPAA
2009
ACM
15 years 7 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
123
click to vote
STACS
2007
Springer
15 years 6 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
119
click to vote
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
141
click to vote
SIAMJO
2010
14 years 11 months ago
2010
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
133
Voted
TMC
2008
15 years 15 days ago
2008
A k-hop dominating set is a subset of nodes such that each node not in the set can be reached within k hops from at least one node in the set. A connected k-hop dominating set can ...