Pages that link to "Item:Q5131722"

The following pages link to Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722):

Displaying 2 items.

• Connected domination in maximal outerplanar graphs (Q2192107) (← links)
• Constant Approximation for the Lifetime Scheduling Problem of <i>p</i>-Percent Coverage (Q5058008) (← links)