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...
zur Erlangung des Grades eines (2006)
Stefan Krause, Referent Prof, T. Zimmermann, ...
Ich danke allen Angehörigen des Instituts für Mathematische Optimierung für die ausgesprochen angenehme Arbeitsumgebung, die für die Entstehung dieser Dissertation sehr wichtig war. Mein Dank...
On the reflexivity of point sets (2003)
S Andor, P. Fekete, Esther M. Arkin, Esther M. Arkin, Sandor P. Fekete, Ferran Hurtado, ...
x We introduce a new measure for planar point sets S. Intuitively, it describes the combinatorial distance from a convex set: The reflexivity (S) of S is given by the smallest number of reflex...
Minimizing The Stabbing Number Of Matchings, Trees, And Triangulations (2003)
Sandor P. Fekete, S Andor, P. Fekete, Marco E. LÜbbecke, Henk Meijer
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate problems of finding...
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...
Rectangle and Box Visibility Graphs in 3D (1996)
Sandor P. Fekete, S'andor P. Fekete, S Andor, P. Fekete, Henk Meijer, Henk Meijer, ...
We discuss rectangle and box visibility representations of graphs in 3-dimensional space. In these representations, vertices are represented by axis-aligned disjoint rectangles or boxes. Two vertices...
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...