The bottleneck \(k\)-MST

DOI10.1016/j.ipl.2005.05.025zbMath1185.68859OpenAlexW1976936897MaRDI QIDQ1041824

Olena Chapovska, Abraham P. Punnen

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.05.025

zbMATH Keywords

computational complexityanalysis of algorithmsgraph algorithmsbottleneck problems\(k\)-MST

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation algorithms (68W25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Unnamed Item
• A linear time algorithm for the maximum capacity path problem
• The Min-Max Spanning Tree Problem and some extensions
• The partial sum criterion for Steiner trees in graphs and shortest paths
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
• Algorithms for two bottleneck optimization problems

This page was built for publication: The bottleneck \(k\)-MST