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

Nash equilibria represent a cornerstone in game theory, defining strategy profiles wherein no player can benefit by unilaterally deviating. This concept underpins a myriad of applications, ranging ...

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

Such algorithms find approximate (slightly suboptimal) solutions to optimization problems in polynomial time. Unlike heuristics, approximation algorithms have provable performance guarantees: they ...

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

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