Online algorithms deal with settings where the input data arrives over time and the current decision must be made by the algo- rithm without the knowledge of future input. In the last few years, the online primal-dual approach, pioneered by Buchbinder and Naor, has emerged as a very powerful and general method to systematically design and analyze online algorithms. In this talk, I will give an overview of the method and show how it uni es and simpli es various previous results. I will also describe the recent successes of this approach in addressing some classic problems such as weighted paging and the randomized k-server problem. Finally, we will also see some recent extensions of the method.
CITATION STYLE
Bansal, N. (2013). The Primal-Dual Approach for Online Algorithms (pp. 1–1). https://doi.org/10.1007/978-3-642-38016-7_1
Mendeley helps you to discover research relevant for your work.