Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(1)
Linear Time Algorithm
Related Publications
(1)
An Optimal Bound for Two Dimensional Bin Packing
Subscribe
Academic
Publications
On packing squares into a rectangle
On packing squares into a rectangle,10.1016/j.comgeo.2011.05.001,Computational Geometry: Theory and Applications,Stefan Hougardy
Edit
On packing squares into a rectangle
(
Citations: 6
)
BibTex

RIS

RefWorks
Download
Stefan Hougardy
We prove that every set of squares with total area 1 can be packed into a rectangle of area at most 2867/2048=1.399… . This improves on the previous best bound of 1.53. Also, our proof yields a
linear time algorithm
for finding such a packing.
Journal:
Computational Geometry: Theory and Applications  COMGEO
, vol. 44, no. 8, pp. 456463, 2011
DOI:
10.1016/j.comgeo.2011.05.001
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.sciencedirect.com
)
Citation Context
(1)
...Exceptions are the work of Kleitman and Krieger [20] and the work by Novotny [
28
], that consider the special case of packing squares into a minimum area rectangle...
...Bounds for this problems have been obtained by Kleitman and Krieger [20] and by Novotny [
28
]...
Nikhil Bansal
,
et al.
Bin Packing in Multiple Dimensions: Inapproximability Results and Appr...
References
(11)
An Optimal Bound for Two Dimensional Bin Packing
(
Citations: 11
)
Daniel J. Kleitman
,
Michael M. Krieger
Conference:
IEEE Symposium on Foundations of Computer Science  FOCS
, pp. 163168, 1975
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
(
Citations: 37
)
Nikhil Bansal
,
José R. Correa
,
Claire Kenyon
,
Maxim Sviridenko
Journal:
Mathematics of Operations Research  MOR
, vol. 31, no. 1, pp. 3149, 2006
Research problems in discrete geometry
(
Citations: 216
)
Peter Brass
,
William O. J. Moser
,
János Pach
Published in 2005.
Unsolved problems in geometry
(
Citations: 251
)
H. T. Croft
,
K. J. Falconer
,
R. K. Guy
Published in 1991.
On packing squares into a rectangle
(
Citations: 6
)
Stefan Hougardy
Journal:
Computational Geometry: Theory and Applications  COMGEO
, vol. 44, no. 8, pp. 456463, 2011
Sort by:
Citations
(6)
On packing squares into a rectangle
(
Citations: 6
)
Stefan Hougardy
Journal:
Computational Geometry: Theory and Applications  COMGEO
, vol. 44, no. 8, pp. 456463, 2011
Effect of nButane and propane on performance and emission characteristics of an SI engine operated with DMEblended LPG fuel
Seokhwan Lee
,
Seungmook Oh
,
Young Choi
,
Kernyong Kang
Journal:
Fuel
, vol. 90, no. 4, pp. 16741680, 2011
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
(
Citations: 37
)
Nikhil Bansal
,
José R. Correa
,
Claire Kenyon
,
Maxim Sviridenko
Journal:
Mathematics of Operations Research  MOR
, vol. 31, no. 1, pp. 3149, 2006
On Packing Squares with Resource Augmentation: Maximizing the Profit
(
Citations: 3
)
Aleksei V. Fishkin
,
Olga Gerber
,
Klaus Jansen
,
Roberto Solisoba
Conference:
Computing: The Australasian Theory Symposium  CATS
, pp. 6167, 2005
Approximation schemes for multidimensional packing
(
Citations: 20
)
José R. Correa
,
Claire Kenyon
Conference:
ACMSIAM Symposium on Discrete Algorithms  SODA
, pp. 186195, 2004