88 citations · 270 across the 32 of their papers we have counts for
Showing 2006Show all
2 papers · 1 filter
cs.DS2006★ 1 cited
An exact algorithm for higher-dimensional orthogonal packing
Sandor P. Fekete, Joerg Schepers, Jan C. van der Veen
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for…
cs.DS2006★ 27 cited
Minimum-Cost Coverage of Point Sets by Disks
Esther M. Arkin, Herve Broennimann, Jeff Erickson +5
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (t_j) and radii (r_j) that cover a given set o…