The subset assignment problem for data placement in caches

DOI10.1007/s00453-017-0403-4zbMath1392.68177OpenAlexW2963714840MaRDI QIDQ724230

Jenny Lam, Sandy Irani, Shahram Ghandeharizadeh

Publication date: 25 July 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6805/

zbMATH Keywords

linear programmingmemory managementsimplex methodminimum cost flowcaching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Information storage and retrieval of data (68P20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A nearly linear-time PTAS for explicit fractional packing and covering linear programs
• A new polynomial-time algorithm for linear programming
• Fast Algorithms for Bipartite Network Flow
• Improved Algorithms for Bipartite Network Flow
• Probabilistic methods for web caching
• Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks

This page was built for publication: The subset assignment problem for data placement in caches