Theoretical Computer Science ( IF 0.747 ) Pub Date : 2020-08-10 , DOI: 10.1016/j.tcs.2020.07.033
We consider the two families of approximation algorithms that are known to guarantee $O\left(\mathrm{log}n\right)$ approximation for the scheduling problem, where n is the number of links. We present network constructions showing that the approximation ratios of those algorithms are no better than logarithmic, both in n and in Δ, where Δ is a geometric parameter – the ratio of the maximum and minimum link lengths.