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

An example of the quadratic assignment problem (QAP) is the facility location problem, in which n facilities are assigned, at minimum cost, to n sites. Between each pair of facilities, there is a ...