תקציר
The k-server problem is a fundamental online problem where k mobile servers should be scheduled to answer a sequence of requests for points in a metric space as to minimize the total movement cost. While the deterministic competitive ratio is at least k, randomized k-server algorithms have the potential of reaching o(k) competitive ratios. This goal may be approached by using probabilistic metric approximation techniques. This paper gives the first results in this direction obtaining o(k) competitive ratio for a natural class of metric spaces, including d-dimensional grids, and wide range of k. Prior to this work no result of this type was known beyond results for specific metric spaces.
| שפה מקורית | אנגלית |
|---|---|
| עמודים | 659-664 |
| מספר עמודים | 6 |
| סטטוס פרסום | פורסם - 2004 |
| פורסם באופן חיצוני | כן |
| אירוע | Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms - New Orleans, LA., ארצות הברית משך הזמן: 11 ינו׳ 2004 → 13 ינו׳ 2004 |
כנס
| כנס | Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| מדינה/אזור | ארצות הברית |
| עיר | New Orleans, LA. |
| תקופה | 11/01/04 → 13/01/04 |
הערה ביבליוגרפית
Funding Information:✩ A preliminary version of this work appears in Proceedings of the 15th Annual ACM–SIAM Symposium on Discrete Algorithms, 2004, pp. 659–664. * Corresponding author. E-mail addresses: [email protected] (Y. Bartal), [email protected] (M. Mendel). 1 Supported in part by a grant from the Israeli Science Foundation (195/02). 2 Supported in part by the Landau Center.