scientific article; zbMATH DE number 5764849
From MaRDI portal
Publication:3579442
Cited in
(21)- The k-hop connected dominating set problem: approximation and hardness
- Wireless networking, dominating and packing
- Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem
- A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks
- Minimum non-submodular cover problem with applications
- A cross-monotonic cost-sharing scheme for the concave facility location game
- The k-hop connected dominating set problem: hardness and polyhedra
- Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph
- Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks
- Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set
- On minimum submodular cover with submodular cost
- Algorithmic complexity of weakly connected Roman domination in graphs
- A greedy algorithm for the minimum 2-connected m-fold dominating set problem
- New dominating sets in social networks
- A unified greedy approximation for several dominating set problems
- Fault-tolerant total domination via submodular function approximation
- On positive influence dominating sets in social networks
- Supermodular rank: set function decomposition and optimization
- Greedy approximation for the minimum connected dominating set with labeling
- Influence maximization problem: properties and algorithms
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 Q3579442)
