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

In practice, the actual approximation factor is far better; we provide a specific example by generating a nearly-optimal inter-league tournament for the 30-team National Basketball Association, with ...

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

Bruce L. Chalmers, The Remez Exchange Algorithm for Approximation With Linear Restrictions, Transactions of the American Mathematical Society, Vol. 223 (Oct., 1976), pp. 103-131 ...

Although efficient in a strictly theoretical sense (i.e., in the sense of taking polynomial versus exponential time), this algorithm for the permanent is not practical. Indeed, to date, no practical ...