Pages that link to "Item:Q287982"
From MaRDI portal
The following pages link to Nearly optimal bounds for distributed wireless scheduling in the SINR model (Q287982):
Displaying 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)
- Distributed \((\varDelta + 1)\)-coloring in the physical model (Q742411) (← links)
- Wireless capacity with arbitrary gain matrix (Q742412) (← links)
- Conflict graphs and the SINR-capacity of the mean power scheme (Q896135) (← links)
- Distributed multiple-message broadcast in wireless ad hoc networks under the SINR model (Q896696) (← links)
- Computing large independent sets in a single round (Q1699422) (← links)
- On local broadcasting schedules and CONGEST algorithms in the SINR model (Q1796435) (← links)
- Limitations of current wireless link scheduling algorithms (Q2202005) (← links)
- Vertex coloring edge-weighted digraphs (Q2348711) (← links)
- Network design under general wireless interference (Q2665910) (← links)
- A maximum clique based approximation algorithm for wireless link scheduling under SINR model (Q2672948) (← links)
- Near-optimal scheduling of distributed algorithms (Q2796236) (← links)
- Broadcast scheduling problem in SINR model (Q2929620) (← links)
- (Q3012953) (redirect page) (← links)
- Spanning Trees With Edge Conflicts and Wireless Connectivity (Q5002848) (← links)
- The Power of Oblivious Wireless Power (Q5269826) (← links)
- Generalizing the Square Root Rule for Optimal Periodic Scheduling in Push-Based Wireless Environments (Q5274407) (← links)
- Effective Wireless Scheduling via Hypergraph Sketches (Q5858652) (← links)
- Token traversal in ad hoc wireless networks via implicit carrier sensing (Q5919418) (← links)
