Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
Artur Czumaj, Jurek Czyzowicz, Leszek Gasieniec, J...
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
Mathias Weller, Christian Komusiewicz, Rolf Nieder...
Abstract We show that if one can find the optimal value of an integer programming problem min{cx : Ax ≥ b, x ∈ Zn +} in polynomial time, then one can find an optimal solution...
James B. Orlin, Abraham P. Punnen, Andreas S. Schu...
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter for a polyhedral surface. Distances on the surface a...
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...