most citedDistributed Approximation Algorithms for the Multiple Knapsack Problem

4 citations · 4 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2017★ 4 cited

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 items are to be distributed amongst processors, each with a knapsack. We propose different…