Pricelists.org Pricelists.org تسجيل الدخول إنشاء حساب

The Steiner Tree Problem

☆☆☆☆☆ (0 reviews)
Show price history
The Steiner Tree Problem
Lowest price (incl. delivery)
6 453,00 JPY
Typical price405,06 PLN
Lowest (90 days)46,79 PLN
Offers4
Last updatedمنذ أسبوع
See best offer
Price history (90 days)
Full history
2026-08-08 2026-08-15
سجل الأسعار
تاريخ التحديثالسعر
2026-08-0846,79
2026-08-1446,79
2026-08-1553,50
البائع Product price Delivery الإجمالي التوفر Updated
SP SpringerNatureLink Shop INT 6 434,00 JPY 19,00 JPY 6 453,00 JPY متوفر منذ 5 أيام View offer
SP Springer Nature Author 6 434,00 JPY 15,00 JPY 6 449,00 JPY متوفر منذ أسبوع View offer
VI VitalSource 48,14 EUR free 48,14 EUR متوفر منذ أسبوع View offer
SP SpringerNatureLink Shop INT 53,50 EUR 29,00 EUR 82,50 EUR متوفر منذ 5 أيام View offer

قد تتغيّر الأسعار والتوفر. آخر تحديث: 08.08.2026 10:24.

EAN 9783528067625
Springer Nature
0,0
☆☆☆☆☆
0 reviews
5★ 0%
4★ 0%
3★ 0%
2★ 0%
1★ 0%

Product reviews

Rating
No reviews yet — be the first!
"A very simple but instructive problem was treated by Jacob Steiner, the famous representative of geometry at the University of Berlin in the early nineteenth century. Three villages A,B ,C are to be joined by a system of roads of minimum length. " Due to this remark of Courant and Robbins (1941), a problem received its name that actually reaches two hundred years further back and should more appropriately be attributed to the French mathematician Pierre Fermat. At the end of his famous treatise "Minima and Maxima" he raised the question to find for three given points in the plane a fourth one in such a way that the sum of its distances to the given points is minimized - that is, to solve the problem mentioned above in its mathematical abstraction. It is known that Evangelista Torricelli had found a geometrical solution for this problem already before 1640. During the last centuries this problem was rediscovered and generalized by many mathematicians, including Jacob Steiner. Nowadays the term "Steiner prob­ lem" refers to a problem where a set of given points PI, . . . ,Pn have to be connected in such a way that (i) any two of the given points are joined and (ii) the total length (measured with respect to some predefined cost function) is minimized.

Similar products