Approximating Steiner trees in graphs with restricted weights

DOI10.1002/(SICI)1097-0037(199807)31:4%3C283::AID-NET8%3E3.0.CO;2-9MaRDI QIDQ4540056zbMATH OpenOpenAlexFDO

Authors Magnús M. Halldórsson, Shuichi Ueno, Hiroshi Nakao, Yoji Kajitani

Publication date 21 July 2002

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199807)31:4%3C283::aid-net8%3E3.0.co;2-9

zbMATH Keywords

algorithmsSteiner treeweights

Mathematics Subject Classification ID

Trees (05C05) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1445376
• Tighter Bounds for Graph Steiner Tree Approximation
• Approximating the weight of shallow Steiner trees
• scientific article; zbMATH DE number 4063109
• A faster approximation algorithm for the Steiner problem in graphs

Cited in

(4)

• Approximating the weight of shallow Steiner trees
• On the restricted 1-Steiner tree problem
• Steiner tree reoptimization in graphs with sharpened triangle inequality
• scientific article; zbMATH DE number 7053371 (Why is no real title available?)

This page was built for publication: Approximating Steiner trees in graphs with restricted weights

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