Growing a random maximal independent set produces a 2-approximate vertex cover

DOI10.1137/1.9781611977936.32MaRDI QIDQ6545133FDOQ6545133

Authors: Nate Veldt 

Publication date: 29 May 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Growing a random maximal independent set produces a 2-approximate vertex cover

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545133)