Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...

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

This paper presents a generalization of the Remez multiple-exchange (ME) algorithm for solving complex Chebyshev approximation by polynomials on the unit circle. The difficulties of implementing the ...