Presentation 2001/5/11
The Room Minimization Problem for Floorplan
Yasuhiro Takashima, Hiroshi Murata,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The room minimization problem on floorplan with give number of module is considered. We show that the minimum rooms floorplan holds that (1) an empty room is T-wheel, and (2) no room shares the end point of wall, and prove that the number of rooms incident to a wall is at most two. Given the number of modules, we calculate the minimum number of rooms.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Floorplan / room minimization problem / empty room / T-wheel
Paper # VLD2001-16
Date of Issue

Conference Information
Committee VLD
Conference Date 2001/5/11(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To VLSI Design Technologies (VLD)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) The Room Minimization Problem for Floorplan
Sub Title (in English)
Keyword(1) Floorplan
Keyword(2) room minimization problem
Keyword(3) empty room
Keyword(4) T-wheel
1st Author's Name Yasuhiro Takashima
1st Author's Affiliation School of Information Science, Japan Advanced Institute of Science and Technology:MicroArk Co.,Ltd.()
2nd Author's Name Hiroshi Murata
2nd Author's Affiliation School of Information Science, Japan Advanced Institute of Science and Technology:MicroArk Co.,Ltd.
Date 2001/5/11
Paper # VLD2001-16
Volume (vol) vol.101
Number (no) 46
Page pp.pp.-
#Pages 8
Date of Issue