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

Reviewer Assignment Problem (RAP): The challenge of matching academic submissions to suitable reviewers while optimising for expertise, subject coverage, workload balance, and avoidance of ...

A new algorithm efficiently solves the graph isomorphism problem, which has puzzled computer scientists for decades.

Algorithms An algorithm is a plan, a set of step-by-step instructions to resolve a problem. In an algorithm, each instruction is identified and the order in which they should be carried out is ...

Quantum physicists have developed an algorithm that uses a single qubit to solve a problem that had previously needed thousands of them.

D-Wave quantum annealers solve problems classical algorithms struggle with The latest claim of a clear quantum supremacy solves a useful problem.