Greedy Local Search and Vertex Cover in Sparse Random Graphs

Authors:
Carsten Witt
Affiliations:
DTU Informatics, Technical University of Denmark, Lyngby, Denmark 2800 Kgs.
Venue:
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Year:
2009

Citing 14
Cited 1

Maximum matchings in sparse random graphs: Karp-Sipser revisited

Random Structures & Algorithms
Statistical mechanics perspective on the phase transition in vertex covering offinite-connectivity random graphs

Theoretical Computer Science - Phase transitions in combinatorial problems
Introduction to Algorithms

Introduction to Algorithms
Evolutionary Algorithms and the Maximum Matching Problem

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Evolutionary Algorithms for Vertex Cover

EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method

Random Structures & Algorithms
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem

Theoretical Computer Science
Hybrid evolutionary algorithms on minimum vertex cover for random graphs

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Approximating covering problems by randomized search heuristics using multi-objective models

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Maximum matching in sparse random graphs

SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Analyses of simple hybrid algorithms for the vertex cover problem*

Evolutionary Computation
Simulated annealing beats metropolis in combinatorial optimization

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Worst-case and average-case approximations by simple randomized search heuristics

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Runtime analysis of a simple ant colony optimization algorithm

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation

Analysis of an iterated local search algorithm for vertex cover in sparse random graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, various randomized search heuristics have been studied for the solution of the minimum vertex cover problem, in particular for sparse random instances according to the G (n ,c /n ) model, where c 0 is a constant. Methods from statistical physics suggest that the problem is easy if c e . This work starts with a rigorous explanation for this claim based on the refined analysis of the Karp-Sipser algorithm by Aronson et al. Subsequently, theoretical supplements are given to experimental studies of search heuristics on random graphs. For c