The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights

DOI10.1007/11785293_21MaRDI QIDQ5757874zbMATH OpenOpenAlexFDO

Authors Spyros Angelopoulos

Publication date 7 September 2007

Published in Algorithm Theory – SWAT 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11785293_21

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Parameterized analysis of the online priority and node-weighted Steiner tree problems
• scientific article; zbMATH DE number 1302025
• Improved approximation algorithms for (budgeted) node-weighted Steiner problems
• Approximating Steiner Networks with Node Weights
• Improved methods for approximating node weighted Steiner trees and connected dominating sets.

Cited in

(4)

• Approximations for node-weighted Steiner tree in unit disk graphs
• Parameterized analysis of the online priority and node-weighted Steiner tree problems
• Steiner problems with limited number of branching nodes
• The node-weighted steiner tree problem

This page was built for publication: The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights

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