Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Approximation bounds for the minimum \(k\)-storage problem

From MaRDI portal
Publication:1796432
Jump to:navigation, search

DOI10.1007/978-3-642-45346-5_10zbMath1397.68054OpenAlexW1456668920MaRDI QIDQ1796432

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

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

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


Related Items (1)

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







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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1796432&oldid=14149946"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 08:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki