Pages that link to "Item:Q3558921"
From MaRDI portal
The following pages link to A (4 + ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs (Q3558921):
Displaying 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)
- On pseudo-disk hypergraphs (Q827317) (← 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)
- A better constant-factor approximation for weighted dominating set in unit disk graph (Q1037452) (← links)
- Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs (Q2193275) (← links)
- Improved solution to data gathering with mobile mule (Q2205629) (← links)
- Approximation algorithm for a generalized Roman domination problem in unit ball graphs (Q2292134) (← links)
- Efficient sub-5 approximations for minimum dominating sets in unit disk graphs (Q2453164) (← 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)
- A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
- A (2+ε)-Approximation Scheme for Minimum Domination on Circle Graphs (Q4538081) (← links)
- (Q4952684) (← 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)
- Breaking the <i>O</i>(ln <i>n</i>) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set (Q5131722) (← links)
