Distributed Approximation Algorithms for the Multiple Knapsack Problem

Ananth Murthy, Chandan Yeshwanth, Shrisha Rao

We consider the distributed version of the Multiple Knapsack Problem (MKP), where $m$ items are to be distributed amongst $n$ processors, each with a knapsack. We propose different…