Sciweavers

WADS
2009
Springer
243views Algorithms» more  WADS 2009»
14 years 2 months ago
Approximation Algorithms for Buy-at-Bulk Geometric Network Design
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...
WADS
2009
Springer
281views Algorithms» more  WADS 2009»
14 years 2 months ago
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
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...
Krishnam Raju Jampani, Anna Lubiw
WADS
2009
Springer
232views Algorithms» more  WADS 2009»
14 years 2 months ago
On Making Directed Graphs Transitive
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...
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 2 months ago
Integer Programming: Optimization and Evaluation Are Equivalent
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...
WADS
2009
Springer
298views Algorithms» more  WADS 2009»
14 years 2 months ago
A Comparison of Performance Measures for Online Algorithms
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...
Joan Boyar, Sandy Irani, Kim S. Larsen
WADS
2009
Springer
317views Algorithms» more  WADS 2009»
14 years 2 months ago
Shortest Path Problems on a Polyhedral Surface
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...
Atlas F. Cook, Carola Wenk
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
14 years 2 months ago
Two for One: Tight Approximation of 2D Bin Packing
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 ...
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
WADS
2009
Springer
223views Algorithms» more  WADS 2009»
14 years 2 months ago
Fault Tolerant External Memory Algorithms
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 ...
Gerth Stølting Brodal, Allan Grønlun...
WADS
2009
Springer
243views Algorithms» more  WADS 2009»
14 years 2 months ago
Resolving Loads with Positive Interior Stresses
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...
Günter Rote, André Schulz