Pages that link to "Item:Q2290655"
From MaRDI portal
The following pages link to Approximation algorithms for the connected sensor cover problem (Q2290655):
Displaying 13 items.
- An approximation algorithm for maximum weight budgeted connected set cover (Q281790) (← links)
- Optimization of wireless sensor networks deployment with coverage and connectivity constraints (Q829179) (← links)
- Monotonic optimization for sensor cover energy problem (Q1800445) (← links)
- Hybrid approximation for minimum-cost target coverage in wireless sensor networks (Q1958636) (← links)
- Covering users by a connected swarm efficiently (Q2037819) (← links)
- Computing a tree having a small vertex cover (Q2272400) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- Efficient point coverage in wireless sensor networks (Q2369973) (← links)
- Maximum lifetime connected coverage with two active-phase sensors (Q2392753) (← links)
- (Q2934699) (← links)
- (Q3196383) (redirect page) (← links)
- A robust sensor covering and communication problem (Q4632910) (← links)
- Constant Approximation for the Lifetime Scheduling Problem of <i>p</i>-Percent Coverage (Q5058008) (← links)