Arkin Esther M.

Esther M. Arkin

Information about the author Esther M. Arkin will soon be added to the site.
Found 8 papers in total
The k-path tree matroid and its applications to survivable network design
The k-path tree matroid and its applications to survivable network design
2008
We define the k -path tree matroid, and use it to solve network design problems in...
The Freeze-Tag Problem: How to wake up a swarm of robots
The Freeze-Tag Problem: How to wake up a swarm of robots
2006
An optimization problem that naturally arises in the study of swarm robotics is the...
Approximation algorithms for lawn mowing and milling
Approximation algorithms for lawn mowing and milling
2000
We study the problem of finding shortest tours/paths for ‘lawn mowing’ and...
Minimum-diameter covering problems
Minimum-diameter covering problems
2000
A set V and a collection of (possibly nondisjoint) subsets are given. Also given is a...
Restricted delivery problems on a network
Restricted delivery problems on a network
1997
We consider a delivery problem on a network in which nodes have supplies or demands...
On the maximum scatter traveling salesperson problem
On the maximum scatter traveling salesperson problem
1999
We study the problem of computing a Hamiltonian tour (cycle) or path on a set of...
The lazy bureaucrat scheduling problem
The lazy bureaucrat scheduling problem
1999
We introduce a new class of scheduling problems in which the optimization is performed...
Weighted-tardiness scheduling on parallel machines with proportional weights
Weighted-tardiness scheduling on parallel machines with proportional weights
1991
In this paper, the authors address the problem of scheduling a number of jobs on a...
Papers per page: