Pages that link to "Item:Q3826350"
From MaRDI portal
The following pages link to Link scheduling in polynomial time (Q3826350):
Displaying 28 items.
- Queue-proportional rate allocation with per-link information in multihop wireless networks (Q335906) (← links)
- An improved approximation algorithm for the shortest link scheduling in wireless networks under SINR and hypergraph models (Q346485) (← links)
- Optimal scaling of average queue sizes in an input-queued switch: an open problem (Q383214) (← links)
- Link scheduling in wireless sensor networks: distributed edge-coloring revisited (Q436862) (← links)
- Optimization architecture for joint multi-path routing and scheduling in wireless mesh networks (Q638903) (← links)
- A robust multi-priority topology-independent transmission schedule for packet radio networks (Q672668) (← links)
- A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model (Q714763) (← links)
- A combinatorial algorithm for the TDMA message scheduling problem (Q839680) (← links)
- Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems (Q880502) (← links)
- Approximate dynamic programming for link scheduling in wireless mesh networks (Q925829) (← links)
- Competitive analysis of scheduling algorithms for aggregated links (Q930606) (← links)
- The performance of an upper bound on the fractional chromatic number of weighted graphs (Q968556) (← links)
- Data transfers in networks (Q1097687) (← links)
- A polynomial-time algorithm for message routing in hierarchical communication networks (Q1129965) (← links)
- Computing the optimal IO sequences of a protocol in polynomial time (Q1183459) (← links)
- Dynamic scheduling for minimum delay in tandem and parallel constrained queueing models (Q1315350) (← links)
- Optimal scheduling in CDMA packet radio networks (Q1389195) (← links)
- Optimal consistent network updates in polynomial time (Q1660929) (← links)
- A near-optimal optimization algorithm for link assignment in wireless ad-hoc networks (Q2508381) (← links)
- A maximum clique based approximation algorithm for wireless link scheduling under SINR model (Q2672948) (← links)
- Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model (Q2682938) (← links)
- Optimal edge-coloring with edge rate constraints (Q2811307) (← links)
- On the Complexity of Scheduling in Half-Duplex Diamond Networks (Q2976842) (← links)
- Round weighting problem and gathering in radio networks with symmetrical interference (Q3178168) (← links)
- ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS (Q5249291) (← links)
- Distance edge coloring and collision‐free communication in wireless sensor networks (Q5326804) (← links)
- Towards the Chen-Raspaud conjecture (Q6177406) (← links)
- Multi-channel assignment and link scheduling for prioritized latency-sensitive applications (Q6536160) (← links)
