On full bottleneck Steiner tree problem

MaRDI QIDQ3640695zbMATH OpenFDO

Authors Nini Kang, Heng-Yong Tang

Publication date 11 November 2009

zbMATH Keywords

complexity of timefull bottleneck Steiner treeminimum spanning treepolynomial algorithm

Mathematics Subject Classification ID

Trees (05C05) Programming involving graphs or networks (90C35)

Recommendations

• On the full and bottleneck full Steiner tree problems
• On the hardness of full Steiner tree problems
• On the Euclidean bottleneck full Steiner tree problem
• The Euclidean bottleneck full Steiner tree problem
• An optimal algorithm for the Euclidean bottleneck full Steiner tree problem

Cited in

(4)

• On the edge capacitated Steiner tree problem
• On the full and bottleneck full Steiner tree problems
• The bottleneck selected‐internal and partial terminal Steiner tree problems
• On the hardness of full Steiner tree problems

This page was built for publication: On full bottleneck Steiner tree problem

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