Pages that link to "Item:Q5189988"

The following pages link to TWO ALGORITHMS FOR CONNECTED r-HOP k-DOMINATING SET (Q5189988):

Displaying 10 items.

• The \(k\)-hop connected dominating set problem: hardness and polyhedra (Q324721) (← links)
• A greedy algorithm for the fault-tolerant connected dominating set in a general graph (Q405692) (← links)
• Two algorithms for minimum 2-connected \(r\)-hop dominating set (Q1675775) (← links)
• The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
• Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012) (← links)
• Approximation algorithm for partial set multicover versus full set multicover (Q4634530) (← links)
• Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (Q5131721) (← links)
• A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614) (← links)
• Fault-tolerant total domination via submodular function approximation (Q6111966) (← links)
• Progress on fault-tolerant locating-dominating sets (Q6174163) (← links)