Pages that link to "Item:Q5963614"

The following pages link to A greedy algorithm for the minimum \(2\)-connected \(m\)-fold dominating set problem (Q5963614):

Displayed 8 items.

• On approximating (connected) 2-edge dominating set by a tree (Q1635808) ‎ (← links)
• Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) ‎ (← links)
• A greedy algorithm for the fault-tolerant outer-connected dominating set problem (Q2025101) ‎ (← links)
• Further results on the total monochromatic connectivity of graphs (Q2168754) ‎ (← links)
• Optimal channel assignment with list-edge coloring (Q2424801) ‎ (← links)
• Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012) ‎ (← links)
• Computing Minimum <i>k</i>-Connected <i>m</i>-Fold Dominating Set in General Graphs (Q5131721) ‎ (← 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)