scientific article; zbMATH DE number 1424548

MaRDI QIDQ4945797zbMATH OpenFDO

Authors Piotr Berman, Alex Zelikovsky

Publication date 23 March 2000

zbMATH Keywords

bottleneck problemplanar Steiner treepower-\(p\) problem

Mathematics Subject Classification ID

Trees (05C05) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Approximations for a bottleneck Steiner tree problem
• scientific article; zbMATH DE number 1834686
• Optimal and approximate bottleneck Steiner trees
• scientific article; zbMATH DE number 1202981
• scientific article; zbMATH DE number 2044939
• On approximation algorithms for the terminal Steiner tree problem
• Exact algorithms for the bottleneck Steiner tree problem (extended abstract)
• Recent results on approximating the Steiner tree problem and its generalizations
• An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane

Cited in

(4)

• The Power of Dynamic Distance Oracles
• An exact algorithm for the bottleneck 2-connected k-Steiner network problem in L_p planes
• The bottleneck 2-connected k-Steiner network problem for k 2
• Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees

This page was built for publication:

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