共 26 条
[1]
Jarvis RA(1973)On the identification of the convex hull of a finite set of points in the plane Inf Process Lett 2 18-21
[2]
Graham RL(1972)An efficient algorithm for determining the convex hull of a finite planar set Inf Process Lett 1 132-133
[3]
Preparata F(1977)Convex hulls of finite sets of points in two and three dimensions Commun ACM 20 87-93
[4]
Hong SJ(1975)On the complexity of combinatorial problems Netw 5 45-68
[5]
Karp RM(1993)Simple algorithms for Steiner trees and paths packing problems in planar graphs CWI Q 6 219-240
[6]
Wagner D(1980)An approximate solution for the Steiner tree problem in graphs Math Jpn 24 573-577
[7]
Takahashi H(1981)A fast algorithm for Steiner trees Acta Informatica 15 141-145
[8]
Matsuyama A(1974)A fundamental problem in vehicle routing Netw 4 35-64
[9]
Kou L(1956)On the shortest spanning subtree of a graph and the traveling salesman problem In Proc Am Math Soc 7 48-50
[10]
Markowsky G(1957)Shortest connection networks and some generalizations Bell Syst Tech J 36 1389-1401