2 PROBABILISTIC RESULTS ON RECTILINEAR STEINER TREES

被引：24

作者：

BERN, MW

机构：

来源：

关键词：

D O I：

10.1007/BF01762114

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：191 / 204

页数：14

共 24 条

[1] RECTILINEAR STEINER TREES - EFFICIENT SPECIAL-CASE ALGORITHMS [J].

AHO, AV ;

GAREY, MR ;

HWANG, FK .

[2]

BERN MW, 1986, UCBCSD87306 U CAL BE

CHUNG, FRK ;

HWANG, FK .

[4] RECTILINEAR STEINER TREE PROBLEM IS NP-COMPLETE [J].

GAREY, MR ;

JOHNSON, DS .

[5]

Graham, 1981, GEOM DEDICATA, V11, P353, DOI 10.1007/BF00149359

[6]

HAIMOVICH M, COMMUNICATION

[7] O(N LOG N) ALGORITHM FOR SUBOPTIMAL RECTILINEAR STEINER TREES [J].

HWANG, FK .

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1979, 26 (01) :75-77

[8] STEINER MINIMAL TREES WITH RECTILINEAR DISTANCE [J].

HWANG, FK .

[9]

HWANG FK, 1978, DESIGN AUTOMATION FA, V2, P303

[10]

KARP RM, 1985, TRAVELING SALESMAN P, pCH6