69 search results - page 1 / 14 » Experimental Evaluation of the Greedy and Random Algorithms ... |
WEA
2005
Springer
13 years 10 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
CORR
2008
Springer
13 years 3 months ago
2008
Springer
ESA
2001
Springer
13 years 9 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
COMBINATORICS
2002
13 years 4 months ago
2002
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
APPROX
2005
Springer
13 years 10 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...