The following pages link to (Q5365138):
Displayed 21 items.
- Nearly optimal bounds for distributed wireless scheduling in the SINR model (Q287982) (← links)
- Distributed wireless link scheduling in the SINR model (Q328722) (← links)
- An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models (Q346485) (← links)
- Online capacity maximization in wireless networks (Q398842) (← links)
- Wireless capacity with arbitrary gain matrix (Q742412) (← links)
- Comparative study of approximation algorithms and heuristics for SINR scheduling with power control (Q742414) (← links)
- Conflict graphs and the SINR-capacity of the mean power scheme (Q896135) (← links)
- The topology of wireless communication on a line (Q1698733) (← links)
- Limitations of current wireless link scheduling algorithms (Q2202005) (← links)
- Deterministic protocols in the SINR model without knowledge of coordinates (Q2208251) (← links)
- Constant-approximation for optimal data aggregation with physical interference (Q2393081) (← links)
- Optimizing compatible sets in wireless networks through integer programming (Q2513731) (← links)
- Network design under general wireless interference (Q2665910) (← links)
- Convergence Time of Power-Control Dynamics (Q3012955) (← links)
- Batched Point Location in SINR Diagrams via Algebraic Tools (Q3448774) (← links)
- Spanning Trees With Edge Conflicts and Wireless Connectivity (Q5002848) (← links)
- The Power of Oblivious Wireless Power (Q5269826) (← links)
- (Q5743417) (← links)
- Effective Wireless Scheduling via Hypergraph Sketches (Q5858652) (← links)
- Token traversal in ad hoc wireless networks via implicit carrier sensing (Q5919418) (← links)
- The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication (Q6051926) (← links)