Randomized k-Server Algorithms for Growth-Rate Bounded Graphs

Yair Bartal, Manor Mendel

نتاج البحث: نتاج بحثي من مؤتمرمحاضرةمراجعة النظراء


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.

اللغة الأصليةالإنجليزيّة
عدد الصفحات6
حالة النشرنُشِر - 2004
منشور خارجيًانعم
الحدثProceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms - New Orleans, LA., الولايات المتّحدة
المدة: ١١ يناير ٢٠٠٤١٣ يناير ٢٠٠٤


!!ConferenceProceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms
الدولة/الإقليمالولايات المتّحدة
المدينةNew Orleans, LA.

ملاحظة ببليوغرافية

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: yair@cs.huji.ac.il (Y. Bartal), mendelma@yahoo.com (M. Mendel). 1 Supported in part by a grant from the Israeli Science Foundation (195/02). 2 Supported in part by the Landau Center.


أدرس بدقة موضوعات البحث “Randomized k-Server Algorithms for Growth-Rate Bounded Graphs'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا