Efficient Algorithms for the K Bottleneck Paths Problem

Student: Vorobyev Dmitry

Faculty: Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod)

Educational Programme: Data Mining (Master)

Year of Graduation: 2024

Tasks involving graphs play an important role in computer science and applied analysis, including logistics, network technologies, route planning, and product development. One of the main tasks is the Bottleneck Path Problem, which involves finding a path between vertices with the minimum edge weight as the maximum. Solutions to this problem are used in various areas such as logistics, network technologies, urban planning, and business. These solutions are also applied to creating a unified image from multiple photographs. The work compares three algorithms for solving the problem of k maximin paths, where k is the number of vertex pairs, n is the number of vertices, and m is the number of edges.

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses