A LINEAR TIME ALGORITHM FOR OPTIMAL ROUTING AROUND A RECTANGLE

被引：13

作者：

GONZALEZ, TF ^{[1
]}

LEE, SL ^{[1
]}

机构：

[1] PENN STATE UNIV,DEPT COMP SCI,UNIVERSITY PK,PA 16802

来源：

JOURNAL OF THE ACM | 1988年 / 35卷 / 04期

关键词：

D O I：

10.1145/48014.48018

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：810 / 831

页数：22

共 50 条

[1] ALGORITHMS FOR ROUTING AROUND A RECTANGLE
FRANK, A
NISHIZEKI, T
SAITO, N
SUZUKI, H
TARDOS, E
[J]. DISCRETE APPLIED MATHEMATICS, 1992, 40 (03) : 363 - 378
[2] ROUTING MULTITERMINAL NETS AROUND A RECTANGLE
GONZALEZ, TF
LEE, SL
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1986, 35 (06) : 543 - 549
[3] AN EFFICIENT ONE-SIDE HEIGHT MINIMIZATION ALGORITHM FOR ROUTING AROUND A RECTANGLE
TEO, KH
TUAN, TC
[J]. INFORMATION PROCESSING LETTERS, 1992, 44 (02) : 101 - 105
[4] ROUTING IN AND AROUND A RECTANGLE USING THE OVERLAP MODEL
CHAUDHARY, K
ROBINSON, P
[J]. INTEGRATION-THE VLSI JOURNAL, 1991, 11 (02) : 159 - 167
[5] AN OPTIMAL TIME AND MINIMAL SPACE ALGORITHM FOR RECTANGLE INTERSECTION PROBLEMS
LEE, DT
[J]. INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1984, 13 (01): : 23 - 32
[6] An optimal algorithm for rectangle placement
Healy, P
Creavin, M
Kuusik, A
[J]. OPERATIONS RESEARCH LETTERS, 1999, 24 (1-2) : 73 - 80
[7] A LINEAR-TIME OPTIMAL VIA ASSIGNMENT ALGORITHM FOR 3-DIMENSIONAL CHANNEL ROUTING
HO, JM
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 557 : 294 - 307
[8] Algorithms for finding optimal disjoint paths around a rectangle
Chan, WT
Chin, FYL
[J]. ALGORITHMS AND COMPUTATION, PROCEEDINGS, 1997, 1350 : 314 - 323
[9] A LINEAR-TIME ROUTING ALGORITHM FOR CONVEX GRIDS
NISHIZEKI, T
SAITO, N
SUZUKI, K
[J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1985, 4 (01) : 68 - 76
[10] A LINEAR-TIME ALGORITHM FOR ROUTING IN A CONVEX GRID
KAUFMANN, M
[J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1990, 9 (02) : 180 - 184

← 1 2 3 4 5 →