Paper Abstract and Keywords |
Presentation |
2010-11-18 13:00
On the Complexity of Three-Dimensional Orthogonal Face Routing Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2010-68 CST2010-41 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
The 3-D switchbox routing is a fundamental problem on the physical design of 3-D integrated circuits. The 3-D channel is a 3-D grid $G$ and the terminals are vertices of $G$ located in the faces of the 3-D channel. A net is a set of terminals to be connected. The objective of the 3-D switchbox routing problem is to connect the terminals in each net with a Steiner tree (wire) in $G$ in such a way that wires for distinct nets are disjoint. The 3-D orthogonal face routing is a special case of the 3-D switchbox routing such that every terminal is located on a pair of orthogonal faces. This paper shows that the 3-D orthogonal face routing is intractable even though every net has terminals both on the orthogonal faces. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
3-D channel / face / net / NP-hard / terminal / / / |
Reference Info. |
IEICE Tech. Rep., vol. 110, no. 283, CAS2010-68, pp. 19-24, Nov. 2010. |
Paper # |
CAS2010-68 |
Date of Issue |
2010-11-11 (CAS, CST) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
CAS2010-68 CST2010-41 |
Conference Information |
Committee |
MSS CAS |
Conference Date |
2010-11-18 - 2010-11-19 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Kansai Univ. |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
Graphs, Petri Nets, Neural Networks, etc |
Paper Information |
Registration To |
CAS |
Conference Code |
2010-11-CST-CAS |
Language |
English |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
On the Complexity of Three-Dimensional Orthogonal Face Routing |
Sub Title (in English) |
|
Keyword(1) |
3-D channel |
Keyword(2) |
face |
Keyword(3) |
net |
Keyword(4) |
NP-hard |
Keyword(5) |
terminal |
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Satoshi Tayu |
1st Author's Affiliation |
Tokyo Institute of Technology (Tokyo Inst. of Tech.) |
2nd Author's Name |
Shuichi Ueno |
2nd Author's Affiliation |
Tokyo Institute of Technology (Tokyo Inst. of Tech.) |
3rd Author's Name |
|
3rd Author's Affiliation |
() |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2010-11-18 13:00:00 |
Presentation Time |
25 minutes |
Registration for |
CAS |
Paper # |
CAS2010-68, CST2010-41 |
Volume (vol) |
vol.110 |
Number (no) |
no.283(CAS), no.284(CST) |
Page |
pp.19-24 |
#Pages |
6 |
Date of Issue |
2010-11-11 (CAS, CST) |
|