Partitioning a square into rectangles: NP-completeness and approximation algorithms
BEAUMONT, Olivier
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
BOUDET, Vincent
Regularity and massive parallel computing [REMAP]
Laboratoire de l'Informatique du Parallélisme [LIP]
See more >
Regularity and massive parallel computing [REMAP]
Laboratoire de l'Informatique du Parallélisme [LIP]
BEAUMONT, Olivier
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
BOUDET, Vincent
Regularity and massive parallel computing [REMAP]
Laboratoire de l'Informatique du Parallélisme [LIP]
Regularity and massive parallel computing [REMAP]
Laboratoire de l'Informatique du Parallélisme [LIP]
ROBERT, Yves
Regularity and massive parallel computing [REMAP]
Laboratoire de l'Informatique du Parallélisme [LIP]
< Reduce
Regularity and massive parallel computing [REMAP]
Laboratoire de l'Informatique du Parallélisme [LIP]
Language
en
Article de revue
This item was published in
Algorithmica. 2002, vol. 34, p. 217-239
Springer Verlag
Portuguese Abstract
no abstract
no abstractRead less <
Origin
Hal imported