scientific article; zbMATH DE number 742966
From MaRDI portal
Publication:4763408
zbMATH Open0829.68009MaRDI QIDQ4763408FDOQ4763408
Authors: Joseph (Seffi) Naor, Raphael Rom, Yossi Azar 
Publication date: 11 April 1995
Title of this publication is not available (Why is that?)
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
Cited In (24)
- On-line restricted assignment of temporary tasks with unknown durations.
- On-line resource management with applications to routing and scheduling
- Optimal online algorithms for an electronic commerce money distribution system
- Online scheduling of jobs with favorite machines
- Competitive routing of virtual circuits with unknown duration
- Online load balancing of temporary tasks
- An improved lower bound for load balancing of tasks with unknown duration
- On-line load balancing
- On-line load balancing for related machines
- Title not available (Why is that?)
- Worst-case analysis for on-line service policies
- Simultaneously load balancing for every \(p\)-norm, with reassignments
- Improved bounds for on-line load balancing
- Online balanced repartitioning
- Online load balancing with general reassignment cost
- On-line maximum matching in complete multi-partite graphs with an application to optical networks
- Offline file assignments for online load balancing
- On-line maximum matching in complete multipartite graphs with implications to the minimum ADM problem on a star topology
- Stochastic analysis of dynamic processes
- Online Scheduling on a CPU-GPU Cluster
- Online perfect matching and mobile computing
- Load balancing for response time
- The Competitiveness of On-Line Assignments
- Competitive strategies for an online generalized assignment problem with a service consecution constraint
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4763408)
