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

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

The algorithm we propose, IES, gives an approximate solution to the LHD problem regardless of its dimension and size with a theoretical performance guarantee. We introduce two upper bounds for the ...

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