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
This paper is about the Binary Gap Covering Radius Problem which interpolates between the Covering Radius Problem and the Linear Discrepancy problem.
Recommended citation: You can find the BibTeX on the arxiv page.
Download Paper | Download Slides