scientific article; zbMATH DE number 913344

DOI10.1002/(SICI)1097-0037(199601)27:1%3C73::AID-NET6%3E3.0.CO;2-BzbMATH Open0852.90126MaRDI QIDQ4887736

Alice Underwood

Publication date: 5 August 1996

Title of this publication is not available (Why is that?)

zbMATH Keywords

Steiner problemmodified Melzak procedurenode-weighted Steiner trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Title not available (Why is that?) 👍 👎
• An exact algorithm for the node weighted Steiner tree problem 👍 👎
• Improved methods for approximating node weighted Steiner trees and connected dominating sets. 👍 👎
• Approximation schemes for node-weighted geometric Steiner tree problems 👍 👎
• The node-weighted steiner tree problem 👍 👎
• A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees 👍 👎
• Approximation algorithms for constrained for constrained node weighted steiner tree problems 👍 👎
• Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems 👍 👎
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques 👍 👎

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)