Picking Random Vertices (Invited Talk)

Lokshtanov, Daniel

doi:10.4230/LIPIcs.MFCS.2019.3

Document

Picking Random Vertices (Invited Talk)

Author Daniel Lokshtanov

Part of: Volume: 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: Mathematical Foundations of Computer Science (MFCS)
License: Creative Commons Attribution 3.0 Unported license
Publication Date: 2019-08-20

PDF

File

PDF

LIPIcs.MFCS.2019.3.pdf

Filesize: 164 kB
1 pages

Document Identifiers

DOI: 10.4230/LIPIcs.MFCS.2019.3
URN: urn:nbn:de:0030-drops-109478

Subject Classification

ACM Subject Classification

Theory of computation

Keywords

Graph Algorithm

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

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.

Cite As Get 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) https://doi.org/10.4230/LIPIcs.MFCS.2019.3

Author Details

Daniel Lokshtanov

University of California, San Diego, USA

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail