40 search results - page 8 / 8 » icalp 2003 |
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...