Finding optimal non-datapath caching strategies via network flow

DOI10.1016/j.tcs.2022.12.036OpenAlexW4313478423MaRDI QIDQ2682921

Ning Xie, Steven Lyons, Raju Rangaswami

Publication date: 1 February 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.12.036

zbMATH Keywords

cache hit and cache write tradeoffnetwork flow based algorithmnon-datapath cachingoffline cache management

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A short proof of optimality for the MIN cache replacement algorithm
• Finding minimum-cost flows by double scaling
• Finding Minimum-Cost Circulations by Successive Approximation
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Fibonacci heaps and their uses in improved network optimization algorithms
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Network Flow Algorithms
• Combinatorial optimization. Theory and algorithms

This page was built for publication: Finding optimal non-datapath caching strategies via network flow