Pages that link to "Item:Q621836"

The following pages link to New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs (Q621836):

Displaying 22 items.

• Finding minimum weight connected dominating set in stochastic graph based on learning automata (Q712488) (← links)
• Minimizing the total cost of barrier coverage in a linear domain (Q721928) (← links)
• An efficient connected dominating set algorithm in WSNS based on the induced tree of the crossed cube (Q747485) (← links)
• Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
• PTAS for the minimum weighted dominating set in growth bounded graphs (Q1928314) (← links)
• Wireless networking, dominating and packing (Q1958633) (← links)
• Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
• Improved solution to data gathering with mobile mule (Q2205629) (← links)
• Computing a tree having a small vertex cover (Q2272400) (← links)
• On \(f\)-domination: polyhedral and algorithmic results (Q2274147) (← links)
• Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
• Efficient sub-5 approximations for minimum dominating sets in unit disk graphs (Q2453164) (← links)
• Sensor Cover and Double Partition (Q2820119) (← links)
• APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
• A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
• Minimum Dominating Set Problem for Unit Disks Revisited (Q3459050) (← links)
• Constant-approximation for minimum weight partial sensor cover (Q5013505) (← links)
• Constant Approximation for the Lifetime Scheduling Problem of <i>p</i>-Percent Coverage (Q5058008) (← links)
• On the domination polynomial of a digraph: a generation function approach (Q5065224) (← 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)
• New approximations for Maximum Lifetime Coverage (Q5169461) (← links)
• Approximating k-Connected m-Dominating Sets (Q5874545) (← links)