Optimal covering tours with turn costs (2009)
Esther M. Arkin, Michael A. Bender, Erik D. Demaine, S Ándor, P. Fekete, ...
Abstract. 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 sweeps out...
Optimal covering tours with turn costs (2001)
Esther M. Arkin, Michael A. Bender, Erik D. Demaine, S Ándor, P. Fekete, ...
Abstract. 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 sweeps out...
Michael A. Bender, S Ándor, P. Fekete, Alexander Kr Öller, Valentin Polishchuk, ...
Abstract. We introduce and study the minimum-backlog problem (MBP). The MBP arises in sensor networks and is related to the classic k-server problem. It can be understood as a 2-person game played on...