Geometric optimisation and approximation algorithms form a vibrant research area that intersects computational geometry, combinatorial optimisation and algorithm design.

The algorithm we propose, IES, gives an approximate solution to the LHD problem regardless of its dimension and size with a theoretical performance guarantee. We introduce two upper bounds for the ...