Summary: The Competitiveness of On­Line Assignments \Lambda
Yossi Azar y
Computer Science Department
Tel­Aviv University
Tel­Aviv 69978, Israel
Joseph (Seffi) Naor z
Computer Science Department
Technion
Haifa 32000, Israel
Raphael Rom
Sun Microsystems
Mountain View
CA 94043­1100
Abstract
Consider the on­line problem where a number of servers are ready to provide service
to a set of customers. Each customer's job can be handled by any of a subset of the
servers. Customers arrive one­by­one and the problem is to assign each customer to an
appropriate server in a manner that will balance the load on the servers. This problem
can be modeled in a natural way by a bipartite graph where the vertices of one side
(customers) appear one at a time and the vertices of the other side (servers) are known

Source: Azar, Yossi - School of Computer Science, Tel Aviv University

Collections: Computer Technologies and Information Sciences