A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage

DOI10.1137/1.9781611973402.48zbMath1421.68210arXiv1307.3621OpenAlexW3138781140MaRDI QIDQ5384009

Ankur Moitra, Constantinos Daskalakis, Ilias Diakonikolas, Anindya De, Rocco A. Servedio

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.3621

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonconvex programming, global optimization (90C26) Distributed systems (68M14) Approximation algorithms (68W25) Reliability, testing and fault tolerance of networks and computer systems (68M15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Approximation algorithms for stochastic combinatorial optimization problems, Public Bayesian persuasion: being almost optimal and almost persuasive, Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems