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

DOI10.1137/1.9781611975994.45MaRDI QIDQ5146814zbMATH OpenOpenAlexFDO

Authors Theo McKenzie, Hermish Mehta, Luca Trevisan

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)

Cited in

(9)

• Nearly optimal robust secret sharing against rushing adversaries
• scientific article; zbMATH DE number 7650095 (Why is no real title available?)
• Algorithms approaching the threshold for semi-random planted clique
• Planted models for the densest k-subgraph problem
• Semirandom planted clique via 1-norm isometry property
• Finding planted cliques using gradient descent
• Exact recovery of planted cliques in semi-random graphs
• On finding randomly planted cliques in arbitrary graphs
• Independent sets in semi-random hypergraphs

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

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