The minimum k-storage problem on directed graphs

DOI10.1016/J.TCS.2015.06.049MaRDI QIDQ2355709zbMATH OpenOpenAlexFDO

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

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 programmingoptimal algorithmswireless sensor networksstorage 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)

Recommendations

• Approximation bounds for the minimum \(k\)-storage problem
• Minimum Energy Broadcast Routing in Ad Hoc and Sensor Networks with Directional Antennas
• MINIMUM ENERGY BROADCAST ROUTING IN AD HOC AND SENSOR NETWORKS WITH DIRECTIONAL ANTENNAS
• Strong minimum energy hierarchical topology in wireless sensor networks
• scientific article; zbMATH DE number 1688358

Cites work

• scientific article; zbMATH DE number 815575 (Why is no real title available?)
• An O(pn^ 2) algorithm for the p-median and related problems on tree graphs
• Analytical approach to parallel repetition
• Approximation bounds for the minimum \(k\)-storage problem
• Greedy Strikes Back: Improved Facility Location Algorithms
• Storage Placement in Path Networks

Cited in

(2)

• Approximation bounds for the minimum \(k\)-storage problem
• Optimal and heuristic algorithms for data collection by using an energy- and storage-constrained drone

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

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