27 citations · 69 across the 12 of their papers we have counts for
5 papers · 1 filter
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…
The Snowblower Problem
Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell +1
We introduce the snowblower problem (SBP), a new optimization problem that is closely related to milling problems and to some material-handling problems. The objective in the SBP i…
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
Esther M. Arkin, Michael A. Bender, Sandor P. Fekete +2
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of ``asleep'' robots, by having an awakened robo…
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…
The Lazy Bureaucrat Scheduling Problem
Esther M. Arkin, Michael A. Bender, Joseph S. B. Mitchell +1
We introduce a new class of scheduling problems in which the optimization is performed by the worker (single ``machine'') who performs the tasks. A typical worker's objective is to…