Cites work
- A 4 + ε approximation for k-connected subgraphs
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
- An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem
- Approximating fault-tolerant domination in general graphs
- Approximating minimum-cost \(k\)-node connected subgraphs via independence-free graphs
- Approximating minimum-cost connectivity problems via uncrossable bifamilies
- Approximating node connectivity problems via set covers
- Approximating source location and star survivable network problems
- Approximating subset \(k\)-connectivity problems
- Approximation algorithms for connected dominating sets
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs
- Computing Minimum k-Connected m-Fold Dominating Set in General Graphs
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
- Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen
- Erratum: ``Approximating minimum-cost connectivity problems via uncrossable bifamilies
- scientific article; zbMATH DE number 1003253 (Why is no real title available?)
- Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- Independence free graphs and vertex connectivity augmentation
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
- Node-weighted Steiner tree approximation in unit disk graphs
- On approximation algorithms of \(k\)-connected \(m\)-dominating sets in disk graphs
- On the optimal vertex-connectivity augmentation
- Simple heuristics for unit disk graphs
- Spider covers for prize-collecting network activation problem
- Unit disk graphs
Cited in
(10)- On approximating (connected) 2-edge dominating set by a tree
- Approximating \(k\)-connected \(m\)-dominating sets
- scientific article; zbMATH DE number 2080196 (Why is no real title available?)
- Approximation algorithms for connected dominating sets
- scientific article; zbMATH DE number 2172821 (Why is no real title available?)
- Approximating \(k\)-generalized connectivity via collapsing HSTs
- Two-connected spanning subgraphs with at most \(\frac{10}{7}{\mathrm{OPT}}\) edges
- Approximation algorithm for (connected) Italian dominating function
- 2-node-connectivity network design
- Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs
This page was built for publication: Approximating k-Connected m-Dominating Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874545)
