Steiner Trees and Related Problems

本文主要研究Steiner最小树的算法分析与设计及其相关问题。 这些改进 是基于最近的研究Steiner比和更好的算法Steiner最小树的扩展。 许多研究人员已经发现了研究Steiner树问题的新方法。 通过这些方法，最近解决了两个长期存在的问题。 我们的目标是深化和扩展这些方法，以解决其他开放的问题，并提高施泰纳最小树和其他相关问题的算法。 本文的研究内容包括两个方面：（1）物流的分析;（2）物流的构建。

This research concentrates on the analysis and design of heuristics for Steiner minimum trees and related problems. These improvements are based on extensions of recent research on Steiner ratio and better heuristics for Steiner minimum trees. Various researchers have already discovered new methods of studying Steiner tree problems. With such methods, two long-standing problems were recently solved. The goal is to deepen and extend these methods to solve other open problems and to improve heuristics for Steiner minimum trees and other related problems. The research covers the following two aspects: (1) analysis of heuristics; and (2) construction of heuristics.