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

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.

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 string of improved approximation algorithms have since emerged, after computer scientists began looking at the problem with fresh eyes.