Preliminary Research On The Maximum Flow Problem And Euclid Steiner Tree Problem

Maximum flow problem and Euclid Steiner tree problem get rapid development in the operational research. Whether in theory or practice, the establishment and continuous improvement of algorithm provides an important tool that can solve many practical problems. In addition, they are used for the optimization of many concrete mathematical problems, and have wide applications in the engineering principles of computer and communication system, applied mathematics, social military field and other fields. They are NP problems in combination optimization.The difficult of calculation is the inherent nature. The maximum flow problem and Euclid Steiner tree problem have been researched for decades, the progress is grate,but there is a large space to research. Details are as follows:Chapter 1 states the research progress, application background and research significance of the maximum flow problem and the Euclid Steiner tree problem.Chapter 2 outlines the maximum flow problem research, classic augmented path algorithm, algorithm progress and algorithm time complexity. Shortest Augmenting Paths Algorithm improve the running time of the Maximum Flow Problem Corrected Proof.Chapter 3 introduces the Steiner tree problem and algorithm research status,mainly discussing the Euclid Steiner tree problem, gives the property of the Euclidean Steiner tree problem and complexity of the Steiner tree structure, and discusses the European planar within three points, four points, five points of the structure of minimum Steiner tree.Chapter 4 summarizes the content, provides the research difficulties and expectations of this article.