Partitioning a square into rectangles: NP-completeness and approximation algorithms

Olivier Beaumont 1, 2 Vincent Boudet 3, 4 Fabrice Rastello Yves Robert 3, 4
2 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
3 REMAP - Regularity and massive parallel computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Résumé : no abstract
Complete list of metadatas

https://hal.inria.fr/hal-00807407
Contributor : Equipe Roma <>
Submitted on : Wednesday, April 3, 2013 - 2:53:48 PM
Last modification on : Friday, April 20, 2018 - 3:44:24 PM

Identifiers

  • HAL Id : hal-00807407, version 1

Citation

Olivier Beaumont, Vincent Boudet, Fabrice Rastello, Yves Robert. Partitioning a square into rectangles: NP-completeness and approximation algorithms. Algorithmica, Springer Verlag, 2002, 34, pp.217-239. ⟨hal-00807407⟩

Share

Metrics

Record views

260