Pages that link to "Item:Q989801"
From MaRDI portal
The following pages link to Approximation for a scheduling problem with application in wireless networks (Q989801):
Displaying 18 items.
- Nearly optimal bounds for distributed wireless scheduling in the SINR model (Q287982) (← links)
- Approximation algorithms for minimum latency data aggregation in wireless sensor networks with directional antenna (Q391234) (← links)
- Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks (Q437049) (← links)
- Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks (Q2026168) (← links)
- Radio aggregation scheduling (Q2202004) (← links)
- Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks (Q2266832) (← links)
- Constant-approximation for optimal data aggregation with physical interference (Q2393081) (← links)
- An improved distributed data aggregation scheduling in wireless sensor networks (Q2444150) (← links)
- A fast localized algorithm for scheduling sensors (Q2497719) (← links)
- A Large Deviations Analysis of Scheduling in Wireless Networks (Q3547936) (← links)
- Approximability of OFDMA Scheduling (Q3639261) (← links)
- Approximation schemes for wireless networks (Q4962754) (← links)
- Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3 (Q5056059) (← links)
- Optimal Scheduling for Emptying a Wireless Network: Solution Characterization, Applications, Including Deadline Constraints (Q5123824) (← links)
- Generalizing the Square Root Rule for Optimal Periodic Scheduling in Push-Based Wireless Environments (Q5274407) (← links)
- Approximation and Online Algorithms (Q5713439) (← links)
- Effective Wireless Scheduling via Hypergraph Sketches (Q5858652) (← links)
- Scheduling sensors by tiling lattices (Q6483538) (← links)
