scientific article; zbMATH DE number 913344

DOI10.1002/(SICI)1097-0037(199601)27:1%3C73::AID-NET6%3E3.0.CO;2-BMaRDI QIDQ4887736zbMATH OpenFDO

Authors Alice Underwood

Publication date 5 August 1996

Full work available at URL https://doi.org/10.1002/(SICI)1097-0037(199601)27:1%3C73::AID-NET6%3E3.0.CO;2-B

zbMATH Keywords

modified Melzak procedurenode-weighted Steiner treesSteiner problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• An exact algorithm for the node weighted Steiner tree problem
• A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
• The node-weighted steiner tree problem
• Improved methods for approximating node weighted Steiner trees and connected dominating sets.
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Approximation schemes for node-weighted geometric Steiner tree problems
• scientific article; zbMATH DE number 1302025
• Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
• Approximation algorithms for constrained node weighted Steiner tree problems

Cited in

(1)

• GENERALIZED MELZAK'S CONSTRUCTION IN THE STEINER TREE PROBLEM

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 Q4887736)