A New Algorithm for the Robust Semi-random Independent Set Problem

DOI10.1137/1.9781611975994.45OpenAlexW3001449442MaRDI QIDQ5146814

Theo McKenzie, Luca Trevisan, Hermish Mehta

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.03633

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (4)

Independent sets in semi-random hypergraphs ⋮ Unnamed Item ⋮ Algorithms approaching the threshold for semi-random planted clique ⋮ Nearly optimal robust secret sharing against rushing adversaries

This page was built for publication: A New Algorithm for the Robust Semi-random Independent Set Problem