Understand how approximation algorithms compute solutions that are guaranteed to be within some constant factor of the optimal solution. Develop a basic understanding of how linear and integer ...

Greedy bases are those bases where the Thresholding Greedy Algorithm (introduced by S. V. Konyagin and V. N. Temlyakov) produces the best possible approximation up to a constant. In 2017, P. M. Berná ...

This paper demonstrates a Remez exchange algorithm applicable to approximation of real-valued continuous functions of a real variable by polynomials of degree smaller than n with various linear ...