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 ...

A sequence of approximating convex programs are solved in each of these algorithms. Rosen's [7] inner approximation algorithm is a special case of the general inner approximation algorithm presented ...

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á ...