2 papers
cs.DM2024
Efficient search of a minimum tree on points in a space with the -norm
K. V. Kaymakov, D. S. Malyshev
In this paper, we consider the minimum spanning tree problem (for short, MSTP) on an arbitrary set of points of -dimensional space in -norm. For this problem, for each…
cs.DS2024
Efficient Online Sensitivity Analysis For The Injective Bottleneck Path Problem
Kirill V. Kaymakov, Dmitry S. Malyshev
The tolerance of an element of a combinatorial optimization problem with respect to a given optimal solution is the maximum change, i.e., decrease or increase, of its cost, such th…