Pages that link to "Item:Q1871771"
From MaRDI portal
The following pages link to Scheduling time-constrained communication in linear networks (Q1871771):
Displaying 17 items.
- On the complexity of buffer allocation in message passing systems (Q557643) (← links)
- Online time-constrained scheduling in linear and ring networks (Q616984) (← links)
- Approximation algorithms for time-constrained scheduling on line networks (Q693767) (← links)
- Scheduling in synchronous networks and the greedy algorithm (Q1292430) (← links)
- Time-constrained scheduling of weighted packets on trees and meshes (Q1400890) (← links)
- Computing the throughput of a network with dedicated lines (Q1803679) (← links)
- Scheduling parallel batching machines in a sequence (Q2283298) (← links)
- Direct routing: Algorithms and complexity (Q2369874) (← links)
- Online packet-routing in grids with bounded buffers (Q2408091) (← links)
- Scheduling problems in transportation networks of line topology (Q2448158) (← links)
- Bus and buffer usage in in-home digital networks: applying the dantzig-wolfe decomposition (Q2464411) (← links)
- Universal Packet Routing with Arbitrary Bandwidths and Transit Times (Q3009776) (← links)
- Real-Time Message Routing and Scheduling (Q3638880) (← links)
- Link scheduling in polynomial time (Q3826350) (← links)
- Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization (Q5130573) (← links)
- (Q6065401) (← links)
- Approximations for Throughput Maximization (Q6492088) (← links)