149
Voted
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
125
Voted
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
This paper is concerned with compact routing schemes for arbitrary undirected networks in the name-independent model first introduced by Awerbuch, Bar-Noy, Linial and Peleg. A co...
103
click to vote
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
Ï ×ØÙ Ý ÒØ Ö Ø ÔÖ Ø
Ò Ò
Ò Ò × Ò Ð Ò Ô Ö ÐÐ Ð × ×Ý×Ø Ñ׺ Ì Ö Ü ×Ø ØÛÓ Ú ÖÝ ÔÓÔÙÐ Ö ÔÔÖÓܹ Ñ Ø ÓÒ Ð ÓÖ Ø Ñ×
...
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
139
click to vote
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
136
click to vote
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
161
Voted
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...