Dual domination problems in graphs

DOI10.1016/j.jcss.2022.03.003OpenAlexW4223927719MaRDI QIDQ2136849

Luisa Gargano, Gennaro Cordasco, Adele A. Rescigno

Publication date: 16 May 2022

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2022.03.003

zbMATH Keywords

optimizationdominationpolynomial-time approximation

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items

On \(d\)-stable locally checkable problems parameterized by mim-width

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minus domination in graphs
• A note on maximizing a submodular set function subject to a knapsack constraint
• The budgeted maximum coverage problem
• Active influence spreading in social networks
• Whom to befriend to influence people
• Dual Domination
• Optimizing Spread of Influence in Social Networks via Partial Incentives
• A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks
• Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
• An analysis of approximations for maximizing submodular set functions—I
• Evangelism in social networks: Algorithms and complexity
• Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph