Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms
Home
Publications
Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms
Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms
Authors:
OB
Olivier Beaumont
Olivier Beaumont
VB
Vincent Boudet
Vincent Boudet
FR
Fabrice Rastello
Fabrice Rastello
YR
Yves Robert
Yves Robert
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 November 2002
journal article
Published by
Springer Nature
in
Algorithmica
Vol. 34
(3)
,
217-239
DOI:
10.1007/s00453-002-0962-9
Abstract
No abstract available
Keywords
KEY WORDS. NP-COMPLETENESS
APPROXIMATION ALGORITHMS
GEOMETRIC PROBLEMS
HETEROGENEOUS RESOURCES
PARALLEL COMPUTING.
Cited
Cited by 44 articles
Scroll to top