Approximation bounds for the minimum k-storage problem

DOI10.1007/978-3-642-45346-5_10MaRDI QIDQ1796432zbMATH OpenOpenAlexFDO

Authors Gianlorenzo D'Angelo, Daniele Diodati, Alfredo Navarra, Cristina M. Pinotti

Publication date 17 October 2018

Full work available at URL https://doi.org/10.1007/978-3-642-45346-5_10

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• The minimum \(k\)-storage problem on directed graphs
• A \((2+\varepsilon)\)-approximation algorithm for the storage allocation problem
• Approximation algorithms for dynamic storage allocation
• Computing and Combinatorics
• A Membrane Algorithm for the Min Storage Problem
• A constant factor approximation algorithm for the storage allocation problem
• scientific article; zbMATH DE number 1979522
• A polynomial time approximation algorithm for dynamic storage allocation
• On approximation algorithms for the minimum satisfiability problem

Cited in

(3)

• Three approximation algorithms for solving the generalized segregated storage problem.
• Tight analysis of shortest path convergecast in wireless sensor networks
• The minimum \(k\)-storage problem on directed graphs

This page was built for publication: Approximation bounds for the minimum \(k\)-storage problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1796432)