The minimum \(k\)-storage problem on directed graphs

DOI10.1016/j.tcs.2015.06.049zbMath1328.68146OpenAlexW774998647MaRDI QIDQ2355709

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

Publication date: 24 July 2015

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

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

zbMATH Keywords

dynamic programmingwireless sensor networksoptimal algorithmsstorage placement

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Approximation algorithms (68W25)

Related Items (1)

Optimal and heuristic algorithms for data collection by using an energy- and storage-constrained drone

Cites Work

• Unnamed Item
• Approximation bounds for the minimum \(k\)-storage problem
• An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
• Storage Placement in Path Networks
• Greedy Strikes Back: Improved Facility Location Algorithms
• Analytical approach to parallel repetition

This page was built for publication: The minimum \(k\)-storage problem on directed graphs