2 citations · 3 across the 3 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016
Tight Approximation Bounds for the Seminar Assignment Problem
Amotz Bar-Noy, George Rabanca
The seminar assignment problem is a variant of the generalized assignment problem in which items have unit size and the amount of space allowed in each bin is restricted to an arbi…
cs.DS2016
The Densest k-Subhypergraph Problem
Eden Chlamtáč, Michael Dinitz, Christian Konrad +2
The Densest -Subgraph (DS) problem, and its corresponding minimization problem Smallest -Edge Subgraph (SES), have come to play a central role in approximation algorith…