Pages that link to "Item:Q5119165"
From MaRDI portal
The following pages link to Optimal Coverage in Wireless Sensor Networks (Q5119165):
Displaying 21 items.
- Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks (Q2046270) (← links)
- Theoretical design of decentralized auction framework under mobile crowdsourcing environment (Q2098187) (← links)
- Constant-approximation for prize-collecting min-sensor sweep coverage with base stations (Q2151357) (← links)
- Approximation algorithm for prize-collecting sweep cover with base stations (Q2166725) (← links)
- Optimal coverage of an infrastructure network using sensors with distance-decaying sensing quality (Q2350798) (← links)
- Coverage and exposure paths in wireless sensor networks (Q2508398) (← links)
- An approximation algorithm for general energy restricted sweep coverage problem (Q2661766) (← links)
- Construction of minimum edge-fault tolerant connected dominating set in a general graph (Q2698012) (← links)
- Optimal Coverage in Automotive Configuration (Q2807882) (← links)
- Coverage problems in sensor networks: a survey (Q2875072) (← links)
- (Q2987240) (← links)
- Investigating Coverage and Connectivity Trade-offs in Wireless Sensor Networks: The Benefits of MOEAs (Q3556559) (← links)
- Constant Approximation for the Lifetime Scheduling Problem of <i>p</i>-Percent Coverage (Q5058008) (← links)
- Coverage Properties of the Target Area in Wireless Sensor Networks (Q5272180) (← links)
- Limit laws for coverage in backbone-sensor networks (Q5411897) (← links)
- (Q5478232) (← links)
- A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems (Q6151530) (← links)
- Approximation algorithms for maximum weighted target cover problem with distance limitations (Q6571268) (← links)
- The heterogeneous rooted tree cover problem (Q6591623) (← links)
- PTASs for secure dominating set in planar graphs and growth-bounded graphs (Q6611035) (← links)
- Algorithm for partial sweep coverage on a line (Q6633537) (← links)