Pages that link to "Item:Q1330796"
From MaRDI portal
The following pages link to Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps (Q1330796):
Displaying 41 items.
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
- Improved algorithms for latency minimization in wireless networks (Q541672) (← links)
- Approximation algorithms for multiprocessor scheduling under uncertainty (Q613111) (← links)
- On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion (Q744655) (← links)
- Scheduling trains with small stretch on a unidirectional line (Q831686) (← links)
- Invited talk: Resilient distributed algorithms (Q831782) (← links)
- The impact of local policies on the quality of packet routing in paths, trees, and rings (Q835620) (← links)
- Atomic routing games on maximum congestion (Q838146) (← links)
- Approximating call-scheduling makespan in all-optical networks (Q876731) (← links)
- Efficient delay routing (Q1128715) (← links)
- Approximability of flow shop scheduling (Q1290640) (← links)
- Adaptive packet routing for bursty adversarial traffic (Q1577008) (← links)
- On-line and off-line preemptive two-machine job shop scheduling (Q1592758) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- Approximation algorithms for routing and call scheduling in all-optical chains and rings. (Q1853488) (← links)
- On the drift of short schedules. (Q1853539) (← links)
- Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978) (← links)
- FIFO and randomized competitive packet routing games (Q2085747) (← links)
- Near-optimal scheduling in the congested clique (Q2117708) (← links)
- Scheduling problems over a network of machines (Q2281619) (← links)
- Direct routing: Algorithms and complexity (Q2369874) (← links)
- Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
- Online packet-routing in grids with bounded buffers (Q2408091) (← links)
- Scheduling problems in transportation networks of line topology (Q2448158) (← links)
- Low-congestion shortcuts without embedding (Q2657278) (← links)
- Universal Packet Routing with Arbitrary Bandwidths and Transit Times (Q3009776) (← links)
- Bottleneck Congestion Games with Logarithmic Price of Anarchy (Q3162521) (← links)
- Scheduling Bidirectional Traffic on a Path (Q3448803) (← links)
- On the power of randomization for job shop scheduling with<i>k</i>-units length tasks (Q3625688) (← links)
- UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS (Q3636561) (← links)
- Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (Q4521547) (← links)
- Scheduling Problems over Network of Machines (Q5002605) (← links)
- A stochastic process on a network with connections to Laplacian systems of equations (Q5066880) (← links)
- Train Scheduling on a Unidirectional Path (Q5136321) (← links)
- O(log m)-approximation for the routing open shop problem (Q5247701) (← links)
- Routing and scheduling for energy and delay minimization in the powerdown model (Q5326790) (← links)
- Oblivious Routing for Sensor Network Topologies (Q5391122) (← links)
- Bounding Residence Times for Atomic Dynamic Routings (Q5870375) (← links)
- On the benefit of supporting virtual channels in wormhole routers (Q5943124) (← links)
- Approximation Algorithms for Generalized Path Scheduling (Q6065400) (← links)
