This class of problems includes the maximum generalized assignment problem (GAP) 1 and a distributed caching problem (DCP) described in this paper. Given a β-approximation algorithm for finding the ...

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 travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route ...

An algorithm is the backbone of computer operations; it is a step-wise mathematical formula, similar to a recipe, that solves a problem or reaches an otherwise desired end.

As the BTTP requires a distance-optimal schedule linking venues in close proximity, we provide an approximation algorithm for the BTTP based on an approximate solution to the corresponding TSP.

A string of improved approximation algorithms have since emerged, after computer scientists began looking at the problem with fresh eyes.

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

The new algorithm is “absurdly fast,” said Daniel Spielman of Yale University. “I was actually inclined to believe … algorithms this good for this problem would not exist.” Maximum flow has been ...