Sciweavers

106 search results - page 4 / 22
» Almost Square Packing
Sort
View
JCO
2006
128views more  JCO 2006»
13 years 9 months ago
A combinatorial theorem on labeling squares with points and its application
In this paper, we present a combinatorial theorem on labeling disjoint axis-parallel squares of edge length two using points. Given an arbitrary set of disjoint axis-parallel squar...
Binhai Zhu, Minghui Jiang
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 3 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
14 years 3 months ago
Derandomized Squaring of Graphs
We introduce a “derandomized” analogue of graph squaring. This operation increases the connectivity of the graph (as measured by the second eigenvalue) almost as well as squar...
Eyal Rozenman, Salil P. Vadhan
COMBINATORICS
2004
105views more  COMBINATORICS 2004»
13 years 9 months ago
An Answer to a Question by Wilf on Packing Distinct Patterns in a Permutation
We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation ...
Micah Coleman
AIPS
2004
13 years 11 months ago
Optimal Rectangle Packing: New Results
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
Richard E. Korf