Pages that link to "Item:Q1006048"
From MaRDI portal
The following pages link to A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph (Q1006048):
Displayed 18 items.
- A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs (Q437046) (← links)
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs (Q621836) (← links)
- PTAS for the minimum weighted dominating set in growth bounded graphs (Q1928314) (← links)
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA (Q1928496) (← links)
- Wireless networking, dominating and packing (Q1958633) (← links)
- Minimum average routing path clustering problem in multi-hop 2-D underwater sensor networks (Q1958638) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- Approximation algorithm for uniform bounded facility location problem (Q2392747) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- Sensor Cover and Double Partition (Q2820119) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
- Approximation Algorithm for the Uniform Bounded Facility Problem (Q3004651) (← links)
- A BETTER APPROXIMATION FOR MINIMUM AVERAGE ROUTING PATH CLUSTERING PROBLEM IN 2-D UNDERWATER SENSOR NETWORKS (Q3397508) (← 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)
- New approximations for Maximum Lifetime Coverage (Q5169461) (← links)