88 citations · 235 across the 23 of their papers we have counts for
6 papers · 1 filter
Maximum dispersion and geometric maximum weight cliques
Sandor P. Fekete, Henk Meijer
We consider a facility location problem, where the objective is to ``disperse'' a number of facilities, i.e., select a given number k of locations from a discrete set of n candidat…
A combinatorial characterization of higher-dimensional orthogonal packing
Sandor P. Fekete, Joerg Schepers
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have b…
On the continuous Fermat-Weber problem
Sandor P. Fekete, Joseph S. B. Mitchell, Karin Beurer
We give the first exact algorithmic study of facility location problems that deal with finding a median for a continuum of demand points. In particular, we consider versions of the…
Optimal Covering Tours with Turn Costs
Esther M. Arkin, Michael A. Bender, Erik D. Demaine +3
We give the first algorithmic study of a class of ``covering tour'' problems related to the geometric Traveling Salesman Problem: Find a polygonal tour for a cutter so that it swee…
Higher-Dimensional Packing with Order Constraints
Sandor P. Fekete, Ekkehard Koehler, Juergen Teich
We present a first exact study on higher-dimensional packing problems with order constraints. Problems of this type occur naturally in applications such as logistics or computer ar…
The one-round Voronoi game replayed
Sandor P. Fekete, Henk Meijer
We consider the one-round Voronoi game, where player one (``White'', called ``Wilma'') places a set of n points in a rectangular area of aspect ratio r <=1, followed by the second…