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

Article Details
Title:	A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage
Article URLs:	https://doi.org/10.1137/1.9781611973402.48
Alternative Article URLs:
Authors:	Constantinos Daskalakis	MIT
	Anindya De	University of California, Berkeley, Simons Institute
	Ilias Diakonikolas	University of Edinburgh
	Ankur Moitra	MIT
	Rocco A. Servedio	Columbia University
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:	0953960, 1101491, 0835373, 1115703, 1319788
DBLP Key:	conf/soda/DaskalakisDDMS14
Author Comments:

ACM Symposium on Discrete Algorithms, SODA 2014