2 citations · 3 across the 3 of their papers we have counts for
4 papers
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…
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…
Covering the Boundary of a Simple Polygon with Geodesic Unit Disks
George Rabanca, Ivo Vigan
We consider the problem of covering the boundary of a simple polygon on n vertices using the minimum number of geodesic unit disks. We present an O(n \log^2 n+k) time 2-approximati…
Funding Games: the Truth but not the Whole Truth
Amotz Bar-Noy, Yi Gai, Matthew P. Johnson +2
We introduce the Funding Game, in which identical resources are to be allocated among selfish agents. Each agent requests a number of resources and reports a valuatio…