An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem

DOI10.1287/IJOC.8.1.41MaRDI QIDQ4888175zbMATH OpenOpenAlexFDO

Authors Abraham P. Punnen, K. P. K. Nair

Publication date 24 July 1996

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.8.1.41

zbMATH Keywords

additional linear constraintbottleneck spanning treeminimum spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
• Algorithms for two bottleneck optimization problems
• A linear time algorithm for the bottleneck biconnected spanning subgraph problem
• The bottleneck \(k\)-MST
• The constrained minimum spanning tree problem

Cited in

(8)

• A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
• Upgrading min-max spanning tree problem under various cost functions
• A fast algorithm for a class of bottleneck problems
• Constrained matroidal bottleneck problems
• Degree bounded bottleneck spanning trees in three dimensions
• Quadratic bottleneck problems
• The constrained Bottleneck spanning tree problem with upgrades
• Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm

This page was built for publication: An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem

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