Pages that link to "Item:Q5384009"

The following pages link to A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage (Q5384009):

Displaying 3 items.

• Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
• Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems (Q5219721) (← links)
• Public Bayesian persuasion: being almost optimal and almost persuasive (Q6053476) (← links)