On efficient algorithms for bottleneck path problems with many sources

DOI10.1007/S11590-024-02113-0zbMATH Open1547.90219MaRDI QIDQ6542462

Kirill V. Kaymakov, D. S. Malyshev

Publication date: 22 May 2024

Published in: Optimization Letters (Search for Journal in Brave)

zbMATH Keywords

computational complexitydesign and analysis of algorithmsbottleneck path problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Explicit and efficient hash families suffice for cuckoo hashing with a stash
• Über ein Minimalproblem.
• The level ancestor problem simplified
• The Min-Max Spanning Tree Problem and some extensions
• Variations on the bottleneck paths problem
• Fast Algorithms for Finding Nearest Common Ancestors
• Worst-case Analysis of Set Union Algorithms
• Recursive Star-Tree Parallel Data Structure
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• A minimum spanning tree algorithm with inverse-Ackermann type complexity
• Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs.
• Fibonacci heaps and their uses in improved network optimization algorithms
• An improved equivalence algorithm
• Set Merging Algorithms

This page was built for publication: On efficient algorithms for bottleneck path problems with many sources

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