DocumentCode
2243809
Title
Dropping method for rectangle packing problem
Author
Takahashi, Toshihiko
Author_Institution
Graduate Sch. of Sci. & Technol., Niigata Univ., Japan
Volume
1
fYear
2000
fDate
2000
Firstpage
200
Abstract
In the rectangle packing problem, encoding schemes to represent the placements of rectangles are the key factors determining the efficiency of algorithms. SEQ-PAIR is one of the most sophisticated encoding scheme, which has been considered to have a small solution space. In this paper, we begin with a packing procedure that does not look so smart. This procedure, however, leads us to another encoding scheme DS (the abbreviation for Dropping Schedule) whose solution space has the same size as that of SEQ-PAIR. Moreover, we introduce encoding scheme LOT as an advanced version of DS, which has a smaller solution space
Keywords
circuit layout; encoding; network topology; topology; LOT encoding scheme; dropping schedule encoding scheme; rectangle packing problem; rectangle placement; solution space reduction; Encoding; Radio access networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on
Conference_Location
Geneva
Print_ISBN
0-7803-5482-6
Type
conf
DOI
10.1109/ISCAS.2000.857062
Filename
857062
Link To Document