Greedy Local Search and Vertex Cover in Sparse Random Graphs

DOI10.1007/978-3-642-02017-9_43zbMath1241.68107OpenAlexW1559942958WikidataQ57200648 ScholiaQ57200648MaRDI QIDQ3630226

Carsten Witt

Publication date: 3 June 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02017-9_43

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Related Items (1)

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

This page was built for publication: Greedy Local Search and Vertex Cover in Sparse Random Graphs