Improved methods for approximating node weighted Steiner trees and connected dominating sets.
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1302025
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- Improved approximation algorithms for (budgeted) node-weighted Steiner problems
- Improved approximation algorithms for (budgeted) node-weighted Steiner problems
- Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
- Approximation algorithms for constrained node weighted Steiner tree problems
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Approximation schemes for node-weighted geometric Steiner tree problems
- scientific article; zbMATH DE number 1445376
Cites work
- scientific article; zbMATH DE number 3677874 (Why is no real title available?)
- scientific article; zbMATH DE number 1256748 (Why is no real title available?)
- A General Approximation Technique for Constrained Forest Problems
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- A fast algorithm for Steiner trees
- An 11/6-approximation algorithm for the network Steiner problem
- Approximation algorithms for connected dominating sets
- Improved Approximations for the Steiner Tree Problem
- New approximation algorithms for the Steiner tree problems
- On the hardness of approximating minimization problems
- The Steiner problem with edge lengths 1 and 2
- The Steiner tree problem
- The computation of nearly minimal Steiner trees in graphs
Cited in
(44)- A logarithmic approximation algorithm for the minimum energy consumption broadcast subgraph problem
- A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph
- On the hardness of full Steiner tree problems
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs
- Flooding countries and destroying dams
- Energy consumption minimization in ad hoc wireless and multi-interface networks
- The Online Broadcast Range-Assignment Problem
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- Some results for the two disjoint connected dominating sets problem
- The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights
- Navigational guidance -- a deep learning approach
- Cluster before you hallucinate: node-capacitated network design and energy efficient routing
- Parameterized analysis of the online priority and node-weighted Steiner tree problems
- Combinatorial optimization in system configuration design
- scientific article; zbMATH DE number 7561717 (Why is no real title available?)
- Connecting guards with minimum Steiner points inside simple polygons
- The online broadcast range-assignment problem
- A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
- The General Steiner Tree-Star problem.
- More applications of the \(d\)-neighbor equivalence: acyclicity and connectivity constraints
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
- 2-node-connectivity network design
- Parameterized and exact algorithms for class domination coloring
- Improved approximation algorithms for (budgeted) node-weighted Steiner problems
- Revisiting connected dominating sets: an almost optimal local information algorithm
- Spider covering algorithms for network design problems
- Approximating k-Connected m-Dominating Sets
- Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
- The \(k\)-hop connected dominating set problem: approximation and hardness
- Combination algorithms for Steiner tree variants
- Approximating Steiner Networks with Node Weights
- Efficient \(k\)-shot broadcasting in radio networks
- The \(k\)-hop connected dominating set problem: hardness and polyhedra
- Online Node-weighted Steiner Forest and Extensions via Disk Paintings
- Approximating Steiner networks with node-weights
- Sharing the cost of multicast transmissions in wireless networks
- Construction of strongly connected dominating sets in asymmetric multihop wireless networks
- A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
- scientific article; zbMATH DE number 913344 (Why is no real title available?)
- 2-node-connectivity network design
- Approximation algorithms for priority Steiner tree problems
This page was built for publication: Improved methods for approximating node weighted Steiner trees and connected dominating sets.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854264)
