A unified greedy approximation for several dominating set problems
DOI10.1016/J.TCS.2023.114069zbMATH Open1522.90244OpenAlexW4384157409MaRDI QIDQ6093579FDOQ6093579
Authors:
Publication date: 7 September 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114069
Recommendations
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- An analysis of the greedy algorithm for the submodular set covering problem
- New dominating sets in social networks
- Title not available (Why is that?)
- A greedy approximation for minimum connected dominating sets
- The complexity of connected dominating sets and total dominating sets with specified induced subgraphs
- On positive influence dominating sets in social networks
- Greedy approximations for minimum submodular cover with submodular cost
- Partitioning a graph into a dominating set, a total dominating set, and something else
- A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks
- Influence spread in social networks with both positive and negative influences
- Greedy approximation for the minimum connected dominating set with labeling
- An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks
Cited In (10)
- Greedy approximation for the minimum connected dominating set with labeling
- A greedy algorithm for the fault-tolerant outer-connected dominating set problem
- Title not available (Why is that?)
- A greedy approximation algorithm for the uniform metric labeling problem analyzed by a primal-dual technique
- Analyzing the optimal neighborhood: algorithms for budgeted and partial connected dominating set problems
- A heuristic approximation algorithm of minimum dominating set based on rough set theory
- A greedy approximation for minimum connected dominating sets
- A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks
- Connected dominating set in hypergraph
- On parallelizing a greedy heuristic for finding small dominant sets
This page was built for publication: A unified greedy approximation for several dominating set problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6093579)
