scientific article; zbMATH DE number 1302025
From MaRDI portal
Publication:4247267
Recommendations
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- scientific article; zbMATH DE number 1445376
- Approximation algorithms for connected dominating sets
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
- Node-weighted Steiner tree approximation in unit disk graphs
Cited in
(15)- Weighted connected domination and Steiner trees in distance-hereditary graphs
- On approximability of the independent/connected edge dominating set problems
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- Approximations for node-weighted Steiner tree in unit disk graphs
- Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph
- Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees
- Algorithms for Steiner connected dominating set problem based on learning automata theory
- A node-based ILP formulation for the node-weighted dominating Steiner problem
- Algorithms for node-weighted Steiner tree and maximum-weight connected subgraph
- Spider covering algorithms for network design problems
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- scientific article; zbMATH DE number 913344 (Why is no real title available?)
- Approximating Steiner networks with node-weights
- The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights
- Dominating set with quotas: balancing coverage and constraints
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 Q4247267)
