no code implementations • 20 Jan 2022 • Loke Durocher, Panagiotis Karras, Andreas Pavlogiannis, Josef Tkadlec
We show that the problem is NP-hard for both $r>1$ and $r<1$, while the latter case is also inapproximable within any multiplicative factor.
