Sciweavers

27 search results - page 3 / 6
» wads 2009
Sort
View
WADS
2009
Springer
274views Algorithms» more  WADS 2009»
13 years 10 months ago
New Results on Visibility in Simple Polygons
We show that (A), 14 points on the boundary of a Jordan curve, and (B), 16 points in convex position encircled by a Jordan curve, cannot be shattered by interior visibility domains...
Alexander Gilbers, Rolf Klein
WADS
2009
Springer
274views Algorithms» more  WADS 2009»
14 years 3 days ago
Approximating Transitive Reductions for Directed Networks
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
14 years 3 days 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
243views Algorithms» more  WADS 2009»
14 years 3 days 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
237views Algorithms» more  WADS 2009»
14 years 3 days ago
A Pseudopolynomial Algorithm for Alexandrov's Theorem
Alexandrov’s Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of some convex polyhedro...
Daniel M. Kane, Gregory N. Price, Erik D. Demaine