Add to ORKGIn this paper, we deal with two geometric problems arising from heterogeneous parallel computing: how to partition the unit square into p rectangles of given area s₁, s₂,..., sₚ (such that the sum of the s_i is equal to 1), so as to minimize (i) either the sum of the p perimeters of the rectangles (ii) or the largest perimeter of the p rectangles. For both problems, we prove NP-completeness and we introduce approximation algorithms
Let P be a set of n points in the plane. We consider the problem of partitioning P into two subsets ...
AbstractThis paper solves the problem of subdividing a unit square into p rectangles of area 1/p in ...
) 1 Introduction We study several rectangle tiling and packing problems. These are natural combina...
International audienceIn this paper, we deal with two geometric problems arising from heterogeneous ...
In this pape6 we deal with n ~ o geometric problems arising froin heterogeneous parallel computing: ...
In this paper, we deal with two geometric problems arising from heterogeneous parallel computing: ho...
International audienceThe problem of partitioning a square into zones of prescribed areas arises whe...
In this paper, we consider the problem of partitioning a square into a set of zones of prescribed ar...
The problem of partitioning dense matrices into sets of sub-matrices has received increased attentio...
The problem of partitioning an orthogonal polyhedron P into a minimum number of 3D rectangles is kno...
2012 IEEE 26th Parallel and Distributed Processing Symposium Workshops and PhD Forum (IPDPSW), Shang...
In this report, we consider a simple but important linear algebra kernel, matrix-matrix multiplicati...
AbstractA set of rectangles S is said to be grid packed if there exists a rectangular grid (not nece...
A set of rectangles S is said to be gridpacked if there exists a rectangular grid (not necessarily r...
AbstractWe show that the way to partition a unit square into k2+s rectangles, for s=1 or s=-1, so as...
Let P be a set of n points in the plane. We consider the problem of partitioning P into two subsets ...
AbstractThis paper solves the problem of subdividing a unit square into p rectangles of area 1/p in ...
) 1 Introduction We study several rectangle tiling and packing problems. These are natural combina...
International audienceIn this paper, we deal with two geometric problems arising from heterogeneous ...
In this pape6 we deal with n ~ o geometric problems arising froin heterogeneous parallel computing: ...
In this paper, we deal with two geometric problems arising from heterogeneous parallel computing: ho...
International audienceThe problem of partitioning a square into zones of prescribed areas arises whe...
In this paper, we consider the problem of partitioning a square into a set of zones of prescribed ar...
The problem of partitioning dense matrices into sets of sub-matrices has received increased attentio...
The problem of partitioning an orthogonal polyhedron P into a minimum number of 3D rectangles is kno...
2012 IEEE 26th Parallel and Distributed Processing Symposium Workshops and PhD Forum (IPDPSW), Shang...
In this report, we consider a simple but important linear algebra kernel, matrix-matrix multiplicati...
AbstractA set of rectangles S is said to be grid packed if there exists a rectangular grid (not nece...
A set of rectangles S is said to be gridpacked if there exists a rectangular grid (not necessarily r...
AbstractWe show that the way to partition a unit square into k2+s rectangles, for s=1 or s=-1, so as...
Let P be a set of n points in the plane. We consider the problem of partitioning P into two subsets ...
AbstractThis paper solves the problem of subdividing a unit square into p rectangles of area 1/p in ...
) 1 Introduction We study several rectangle tiling and packing problems. These are natural combina...