Efficient computation of all tolerances in the sparse maxmin path problem

DOI10.4213/RM10199EMaRDI QIDQ6986433zbMATH OpenFDO

Authors Kirill V. Kaymakov, D. S. Malyshev

Publication date 12 May 2025

Published in Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4213/RM10199E

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Sensitivity, stability, parametric optimization (90C31) Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47)

Cites work

• Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
• scientific article; zbMATH DE number 1947385 (Why is no real title available?)
• On efficient algorithms for bottleneck path problems with many sources
• Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs
• The Min-Max Spanning Tree Problem and some extensions
• The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
• Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time

This page was built for publication: Efficient computation of all tolerances in the sparse maxmin path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6986433)