An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem

DOI10.1287/ijoc.8.1.41zbMath0853.90115OpenAlexW2045799067MaRDI QIDQ4888175

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

minimum spanning treebottleneck spanning treeadditional linear constraint

Mathematics Subject Classification ID

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

Related Items (5)

Constrained matroidal bottleneck problems ⋮ Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm ⋮ Upgrading min-max spanning tree problem under various cost functions ⋮ Quadratic bottleneck problems ⋮ Degree bounded bottleneck spanning trees in three dimensions

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