Tight Results for Online Convex Paging
Open Access
- 15 June 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1418-1429
Abstract
No abstract availableFunding Information
- National Science Foundation (CCF-1955703, CCF-2224718, CCF-2329230, CCF-2422926)
This publication has 22 references indexed in Scilit:
- Online Min-Max Paging2023
- Online Algorithms for Covering and Packing Problems with Convex Objectives2016
- Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling2013
- An Online Scalable Algorithm for Minimizing ℓk-norms of Weighted Flow Time on Unrelated Machines2011
- Oblivious Routing for the Lp-norm2009
- Load balancing of temporary tasks in the normTheoretical Computer Science, 2006
- Load balancing in the L/sub p/ norm2002
- Ancient and New Algorithms for Load Balancing in the l p NormAlgorithmica, 2001
- Competitive paging algorithmsJournal of Algorithms, 1991
- New Ressults on Server ProblemsSIAM Journal on Discrete Mathematics, 1991