The following pages link to (Q3579442):
Displaying 19 items.
- The \(k\)-hop connected dominating set problem: hardness and polyhedra (Q324721) (← links)
- Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (Q331973) (← links)
- A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692) (← links)
- Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks (Q443711) (← links)
- On minimum submodular cover with submodular cost (Q540698) (← links)
- New dominating sets in social networks (Q604953) (← links)
- On positive influence dominating sets in social networks (Q621845) (← links)
- Greedy approximation for the minimum connected dominating set with labeling (Q828691) (← links)
- Influence maximization problem: properties and algorithms (Q830929) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- Wireless networking, dominating and packing (Q1958633) (← links)
- Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem (Q2099386) (← links)
- A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks (Q2168709) (← links)
- Minimum non-submodular cover problem with applications (Q2245054) (← links)
- A cross-monotonic cost-sharing scheme for the concave facility location game (Q2393059) (← links)
- Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) (← links)
- Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)
- A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614) (← links)
- A unified greedy approximation for several dominating set problems (Q6093579) (← links)
