Pages that link to "Item:Q1964594"
From MaRDI portal
The following pages link to Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules (Q1964594):
Displaying 31 items.
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← 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)
- 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)
- Efficient delay routing (Q1128715) (← links)
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps (Q1330796) (← links)
- Adaptive packet routing for bursty adversarial traffic (Q1577008) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues (Q1899217) (← links)
- FIFO and randomized competitive packet routing games (Q2085747) (← 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)
- Universal Packet Routing with Arbitrary Bandwidths and Transit Times (Q3009776) (← 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)
- (Q4527032) (← links)
- Scheduling Problems over Network of Machines (Q5002605) (← links)
- Train Scheduling on a Unidirectional Path (Q5136321) (← links)
- O(log m)-approximation for the routing open shop problem (Q5247701) (← links)
- Oblivious Routing for Sensor Network Topologies (Q5391122) (← links)
- Time-optimum packet scheduling for many-to-one routing in wireless sensor networks (Q5421614) (← links)
- A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES (Q5696959) (← 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)
- Two exact algorithms for the packet scheduling problem (Q6606173) (← links)
