使闭塞 发表于 2025-3-25 05:09:19

http://reply.papertrans.cn/88/8772/877141/877141_21.png

parasite 发表于 2025-3-25 11:26:01

http://reply.papertrans.cn/88/8772/877141/877141_22.png

使成波状 发表于 2025-3-25 14:57:05

,Fermat’s Problem in Banach-Minkowski Spaces,tances to the three given points is a minimum. Torricelli solved this problem in 1646. He asserted that the circles that circumscribe the equilateral triangles constructed on the side of and outside of the given triangle intersect in the desired point, called the Torricelli point.

genesis 发表于 2025-3-25 16:25:50

The Degrees of the Vertices in Shortest Trees, the networks. On the one hand, the determination of these numbers is the problem to classify singularities in network minimizing for arbitrary norms. On the other hand, this question is closely related to the theory of singularities in energy-minimizing surfaces. The latter task is of great practic

CHAFE 发表于 2025-3-25 21:22:14

http://reply.papertrans.cn/88/8772/877141/877141_25.png

时代 发表于 2025-3-26 01:15:14

http://reply.papertrans.cn/88/8772/877141/877141_26.png

我悲伤 发表于 2025-3-26 05:42:32

http://reply.papertrans.cn/88/8772/877141/877141_27.png

不要不诚实 发表于 2025-3-26 09:53:41

1571-568Xas laymen have stepped on its stage. Usually, the problem is known as Steiner‘s Problem and it can be described more precisely in the following way: Given a finite set of points in a metric space, search for a network that connects these points with the shortest possible length. This shortest netwo

delta-waves 发表于 2025-3-26 15:33:55

http://reply.papertrans.cn/88/8772/877141/877141_29.png

Cardioversion 发表于 2025-3-26 20:46:01

http://reply.papertrans.cn/88/8772/877141/877141_30.png
页: 1 2 [3] 4 5
查看完整版本: Titlebook: Steiner Minimal Trees; Dietmar Cieslik Book 1998 Springer Science+Business Media Dordrecht 1998 Graph theory.Mathematica.calculus.computer