Picking Random Vertices (Invited Talk)

Author Daniel Lokshtanov

Thumbnail PDF


  • Filesize: 164 kB
  • 1 pages

Document Identifiers

Author Details

Daniel Lokshtanov
  • University of California, San Diego, USA

Cite AsGet BibTex

Daniel Lokshtanov. Picking Random Vertices (Invited Talk). In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 138, p. 3:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)


We survey some recent graph algorithms that are based on picking a vertex at random and declaring it to be a part of the solution. This simple idea has been deployed to obtain state-of-the-art parameterized, exact exponential time, and approximation algorithms for a number of problems, such as Feedback Vertex Set and 3-Hitting Set. We will also discuss a recent 2-approximation algorithm for Feedback Vertex Set in Tournaments that is based on picking a vertex at random and declaring it to not be part of the solution.

Subject Classification

ACM Subject Classification
  • Theory of computation
  • Graph Algorithm


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads