The strong metric dimension of graphs and digraphs
Discrete Applied Mathematics
A Stochastic Local Search Approach to Vertex Cover
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
Analyses of simple hybrid algorithms for the vertex cover problem*
Evolutionary Computation
Greedy Local Search and Vertex Cover in Sparse Random Graphs
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
The COMPSET algorithm for subset selection
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Analysis of the (1 + 1)-EA for finding approximate solutions to vertex cover problems
IEEE Transactions on Evolutionary Computation
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
Theoretical Computer Science
Approximating vertex cover using edge-based representations
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
NuMVC: an efficient local search algorithm for minimum vertex cover
Journal of Artificial Intelligence Research
Hi-index | 0.00 |