Pages that link to "Item:Q4376979"
From MaRDI portal
The following pages link to On-line routing of virtual circuits with applications to load balancing and machine scheduling (Q4376979):
Displayed 31 items.
- Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)
- Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
- Worst-case Nash equilibria in restricted routing (Q2637289) (← links)
- Parallel load balancing on constrained client-server topologies (Q2664933) (← links)
- A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations (Q2868635) (← links)
- ONLINE SCHEDULING OF MIXED CPU-GPU JOBS (Q2941090) (← links)
- Strategic Scheduling Games: Equilibria and Efficiency (Q2958675) (← links)
- Optimal Coordination Mechanisms for Unrelated Machine Scheduling (Q3450455) (← links)
- Better Algorithms for Online Bin Stretching (Q3453280) (← links)
- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees (Q3512469) (← links)
- Multicast Routing and Design of Sparse Connectors (Q3637320) (← links)
- (Q4267395) (← links)
- Tight Bounds for Online Vector Scheduling (Q4620410) (← links)
- A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines (Q4689392) (← links)
- Online Scheduling on a CPU-GPU Cluster (Q4922108) (← links)
- Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)
- Minimizing Maximum Flow Time on Related Machines via Dynamic Posted Pricing (Q5111740) (← links)
- Hallucination Helps: Energy Efficient Virtual Circuit Routing (Q5210552) (← links)
- Approximating the Optimal Algorithm for Online Scheduling Problems via Dynamic Programming (Q5245846) (← links)
- Minimum Congestion Mapping in a Cloud (Q5258917) (← links)
- Fast approximation of minimum multicast congestion – Implementation VERSUS Theory (Q5693011) (← links)
- Optimal oblivious routing in polynomial time (Q5917575) (← links)
- Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs (Q5919098) (← links)
- On-line path computation and function placement in SDNs (Q5920222) (← links)
- Randomized on-line scheduling on two uniform machines (Q5937432) (← links)
- On-line load balancing of temporary tasks revisited (Q5958311) (← links)
- Configuration balancing for stochastic requests (Q6085995) (← links)
- Well-behaved online load balancing against strategic jobs (Q6090218) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
- Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation (Q6148085) (← links)
- Weighted packet selection for rechargeable links in cryptocurrency networks: complexity and approximation (Q6201318) (← links)