期刊
THEORETICAL COMPUTER SCIENCE
卷 412, 期 50, 页码 6948-6958出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.tcs.2011.09.007
关键词
NP-completeness; Rectangle packing
资金
- Research Institute for Discrete Mathematics at the University of Bonn
We formulate a generalization of the NP-complete rectangle packing problem by parameterizing it in terms of packing density, the ratio of rectangle areas, and the aspect ratio of individual rectangles. Then we show that almost all restrictions of this problem remain NP-complete and identify some cases where the answer to the decision problem can be found in constant time. (C) 2011 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据