Minimal Connections and What They Reveal

摘要

In this article, we discuss Steiner tree problems. This is an umbrella term for tasks that involve finding connections of minimal length between points in (Euclidean) spaces or on discrete mathematical structures, such as graphs. We demonstrate real-world applications of such problems, which include the study of evolution and the drug-discovery process.