2 citations · 2 across the 2 of their papers we have counts for
2 papers
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.CG2014★ 2 cited
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…