Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
From MaRDI portal
Recommendations
- Approximation algorithms for constrained node weighted Steiner tree problems
- Improved approximation algorithms for (budgeted) node-weighted Steiner problems
- Improved approximation algorithms for (budgeted) node-weighted Steiner problems
- scientific article; zbMATH DE number 1445375
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
Cited in
(28)- Steiner intervals, geodesic intervals, and betweenness
- A simple approximation algorithm for minimum weight partial connected set cover
- A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- Primal-dual approximation algorithms for node-weighted Steiner forest on planar graphs
- An approximation algorithm for maximum weight budgeted connected set cover
- Some Steiner concepts on lexicographic products of graphs
- Optimal relay node placement in delay constrained wireless sensor network design
- Primal-dual approximation algorithms for node-weighted Steiner forest on planar graphs
- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem
- A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM
- The node-weighted steiner tree problem
- scientific article; zbMATH DE number 1796994 (Why is no real title available?)
- Improved approximation algorithms for (budgeted) node-weighted Steiner problems
- Spider covering algorithms for network design problems
- scientific article; zbMATH DE number 913344 (Why is no real title available?)
- Bicriteria approximation tradeoff for the node-cost budget problem
- Approximation algorithms for constrained node weighted Steiner tree problems
- Improved approximation algorithms for (budgeted) node-weighted Steiner problems
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
- Online Node-weighted Steiner Forest and Extensions via Disk Paintings
- Approximating node-weighted \(k\)-MST on planar graphs
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing
- Approximation algorithm for the minimum partial connected Roman dominating set problem
- Approximation algorithms for the maximum connected submodular functions
- An approximation algorithm for the prize-collecting connected dominating set problem
- A graph multi-separator problem for image segmentation
- Approximation algorithms for node-weighted directed Steiner problems
This page was built for publication: Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386209)
