Inverse bottleneck Steiner tree problem under norm

MaRDI QIDQ3164678zbMATH OpenFDO

Authors Shuang Wu, Yang Liu, Nini Kang, Heng-Yong Tang

Publication date 5 November 2010

zbMATH Keywords

\(l_1\) normbottleneck Steiner treeinverse problempolynomial algorithm

Mathematics Subject Classification ID

Trees (05C05) Steiner systems in finite geometry (51E10)

Recommendations

• Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
• Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
• Inverse Bottleneck Optimization Problems on Networks
• Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm

Cited in

(2)

• Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
• Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm

This page was built for publication: Inverse bottleneck Steiner tree problem under norm

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