zbMATH — the first resource for mathematics

Vojtěch Jarník’s work in combinatorial optimization. (English) Zbl 1024.01018
Summary: We discuss two papers of Vojtěch Jarnik [On a minimal problem (Czech), Práce moravské přirodově decké společnosti (Acta Soc. Sci. Nat. Moravicae) 6, 57-63 (1930; JFM 57.1343.07)] and V. Jarník and M. Kössler [On minimal graphs containing \(n\) given points, Čas. Mat. Fys. 63, 223-235 (1934; Zbl 0009.13106)] which are devoted to the Minimal Spanning Tree Problem and the Euclidean Steiner Tree Problem. These papers are historical milestones in combinatorial optimization.
This paper is a modified version of a paper included in B. Novák (Ed.), Life and Work of Vojtěch Jarník, Prometheus, Praha, 1999, pp. 37-54.

01A70 Biographies, obituaries, personalia, bibliographies
90-03 History of operations research and mathematical programming
01A60 History of mathematics in the 20th century
Biographic References:
Jarník, Vojtech
Full Text: DOI