Vojtěch Jarník's work in combinatorial optimization

DOI10.1016/S0012-365X(00)00256-9zbMath1024.01018OpenAlexW2053946214WikidataQ56288511 ScholiaQ56288511MaRDI QIDQ5937915

Jaroslav Nešetřil, Bernhard Korte

Publication date: 30 November 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00256-9

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Biographies, obituaries, personalia, bibliographies (01A70) History of operations research and mathematical programming (90-03)

Related Items (5)

Minimal congestion trees ⋮ The saga of minimum spanning trees ⋮ Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics ⋮ On Hop-Constrained Steiner Trees in Tree-Like Metrics ⋮ THE MINIMUM SPANNING TREE PROBLEM: Jarník's solution in historical and present context

This page was built for publication: Vojtěch Jarník's work in combinatorial optimization