scientific article; zbMATH DE number 742966
From MaRDI portal
Publication:4763408
zbMath0829.68009MaRDI QIDQ4763408
Joseph (Seffi) Naor, Raphael Rom, Yossi Azar
Publication date: 11 April 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (20)
On-line load balancing ⋮ An improved lower bound for load balancing of tasks with unknown duration ⋮ Simultaneously load balancing for every p-norm, with reassignments ⋮ Stochastic analysis of dynamic processes ⋮ Online perfect matching and mobile computing ⋮ Online load balancing of temporary tasks ⋮ Online load balancing with general reassignment cost ⋮ On-line load balancing for related machines ⋮ Load balancing for response time ⋮ On-line maximum matching in complete multi-partite graphs with an application to optical networks ⋮ Offline file assignments for online load balancing ⋮ On-line resource management with applications to routing and scheduling ⋮ Improved bounds for on-line load balancing ⋮ Online Scheduling on a CPU-GPU Cluster ⋮ Unnamed Item ⋮ Competitive routing of virtual circuits with unknown duration ⋮ Worst-case analysis for on-line service policies ⋮ Online scheduling of jobs with favorite machines ⋮ On-Line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology ⋮ On-line restricted assignment of temporary tasks with unknown durations.
This page was built for publication:
