Abstract. We consider the number of different ways to divide a rectangle containing n noncorectilinear points into smaller rectangles by n non-intersecting axis-parallel segments,...
d Abstract] Luca Allulli, Giorgio Ausiello, and Luigi Laura Dip. di Informatica e Sistemistica Universit`a di Roma “La Sapienza” Via Salaria, 113 - 00198 Roma Italy.
Floorplan is a crucial estimation task in the modern layout design of systems on chips. The paper presents a novel theoretical upper bound for slicing floorplans with soft modules...
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the...
In the Imbalance Minimization problem we are given a graph G = (V, E) and an integer b and asked whether there is an ordering v1 . . . vn of V such that the sum of the imbalance of...