Caching with Time Windows and Delays
From MaRDI portal
Publication:5092509
DOI10.1137/20M1346286OpenAlexW3036340251MaRDI QIDQ5092509
Debmalya Panigrahi, Anupam Gupta, Amit Kumar
Publication date: 22 July 2022
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/20m1346286
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic TCP acknowledgment and other stories about \(e/(e-1)\)
- Online service with delay on a line
- Complexity of approximating bounded variants of optimization problems
- New Ressults on Server Problems
- APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES
- Competitive paging algorithms
- Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
- O(depth)-Competitive Algorithm for Online Multi-level Aggregation
- Online service with delay
- Min-Cost Bipartite Perfect Matching with Delays
- Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms
- Online matching: haste makes waste!
- A Primal-Dual Randomized Algorithm for Weighted Paging
- A unified approach to approximating resource allocation and scheduling
- Deterministic min-cost matching with delays
