Sciweavers

JCT
2010
77views more  JCT 2010»
13 years 9 months ago
Obtainable sizes of topologies on finite sets
We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ...
Kári Ragnarsson, Bridget Eileen Tenner
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
14 years 5 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