Hardness of the Binary Covering Radius Problem in Large ell_p Norms
Published in APPROX 2026 (International Conference on Approximation Algorithms for Combinatorial Optimization Problems), 2026
See the paper and slides for more details. (If you for some reason need it) You can find the conference version here.
Recommended citation: You can find the BibTeX on the arxiv page.
Download Paper | Download Slides
