Title of article
Vojtěch Jarnı́kʹs work in combinatorial optimization Original Research Article
Author/Authors
Bernhard Korte، نويسنده , , Jaroslav Ne?et?il، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
17
From page
1
To page
17
Abstract
We discuss two papers of Vojtěch Jarnı́k from 1930 and 1934 which are devoted to the Minimal Spanning Tree Problem and the Euclidean Steiner Tree Problem. These papers are historical milestones in combinatorial optimization.
Keywords
History of mathematics , Graphs , History of computing
Journal title
Discrete Mathematics
Serial Year
2001
Journal title
Discrete Mathematics
Record number
949683
Link To Document