File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Packing squares into a square

TitlePacking squares into a square
Authors
Leung, JYTTam, TWWong, CSYoung, GHChin, FYL
Issue Date1990
PublisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jpdc
Citation
Journal Of Parallel And Distributed Computing, 1990, v. 10 n. 3, p. 271-275 How to Cite?
AbstractThe problem of determining whether a set of rectangles can be orthogonally packed into a larger rectangle has been studied as a geometric packing problem and as a floor planning problem. Recently, there is some renewed interest in this problem, as it is related to a job scheduling problem in a partitionable mesh connected system. In this paper we show that the problem of deciding whether a set of squares can be packed into a larger square is strongly NP-complete, answering an open question posed by Li and Cheng. © 1990.
Persistent Identifierhttp://hdl.handle.net/10722/152229
ISSN
0743-7315
2023 Impact Factor: 3.4
2023 SCImago Journal Rankings: 1.187
ISI Accession Number ID
WOS:A1990EG47400008

 

DC FieldValueLanguage
dc.contributor.authorLeung, JYTen_US
dc.contributor.authorTam, TWen_US
dc.contributor.authorWong, CSen_US
dc.contributor.authorYoung, GHen_US
dc.contributor.authorChin, FYLen_US
dc.date.accessioned2012-06-26T06:36:38Z-
dc.date.available2012-06-26T06:36:38Z-
dc.date.issued1990en_US
dc.identifier.citationJournal Of Parallel And Distributed Computing, 1990, v. 10 n. 3, p. 271-275en_US
dc.identifier.issn0743-7315en_US
dc.identifier.urihttp://hdl.handle.net/10722/152229-
dc.description.abstractThe problem of determining whether a set of rectangles can be orthogonally packed into a larger rectangle has been studied as a geometric packing problem and as a floor planning problem. Recently, there is some renewed interest in this problem, as it is related to a job scheduling problem in a partitionable mesh connected system. In this paper we show that the problem of deciding whether a set of squares can be packed into a larger square is strongly NP-complete, answering an open question posed by Li and Cheng. © 1990.en_US
dc.languageengen_US
dc.publisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jpdcen_US
dc.relation.ispartofJournal of Parallel and Distributed Computingen_US
dc.titlePacking squares into a squareen_US
dc.typeArticleen_US
dc.identifier.emailChin, FYL:chin@cs.hku.hken_US
dc.identifier.authorityChin, FYL=rp00105en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0025521123en_US
dc.identifier.volume10en_US
dc.identifier.issue3en_US
dc.identifier.spage271en_US
dc.identifier.epage275en_US
dc.identifier.isiWOS:A1990EG47400008-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridLeung, JYT=7202180281en_US
dc.identifier.scopusauthoridTam, TW=25938925100en_US
dc.identifier.scopusauthoridWong, CS=7404953378en_US
dc.identifier.scopusauthoridYoung, GH=7402900280en_US
dc.identifier.scopusauthoridChin, FYL=7005101915en_US
dc.identifier.issnl0743-7315-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats