Pages that link to "Item:Q1037452"
From MaRDI portal
The following pages link to A better constant-factor approximation for weighted dominating set in unit disk graph (Q1037452):
Displaying 23 items.
- On connected domination in unit ball graphs (Q537633) (← links)
- Polynomial time approximation schemes for minimum disk cover problems (Q613664) (← links)
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs (Q621836) (← links)
- Tighter approximation bounds for minimum CDS in unit disk graphs (Q652528) (← links)
- Minimizing the total cost of barrier coverage in a linear domain (Q721928) (← links)
- Node-weighted Steiner tree approximation in unit disk graphs (Q849134) (← links)
- A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph (Q1006048) (← links)
- PTAS for the minimum weighted dominating set in growth bounded graphs (Q1928314) (← links)
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (Q2193275) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- Approximation algorithm for uniform bounded facility location problem (Q2392747) (← links)
- Maximum lifetime connected coverage with two active-phase sensors (Q2392753) (← 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)
- A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
- Minimum Dominating Set Problem for Unit Disks Revisited (Q3459050) (← links)
- A (4 + ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs (Q3558921) (← links)
- A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks (Q4446911) (← links)
- Constant Approximation for the Lifetime Scheduling Problem of <i>p</i>-Percent Coverage (Q5058008) (← 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)
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs (Q5505666) (← links)
