Export Reviews, Discussions, Author Feedback and Meta-Reviews

First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. This paper provides an FPTAS for stochastic network design in bidirected trees in time O(n^8/ε^6). The authors achieve this via Dynamic Programming. Since this algorithm is pretty slow, they provide a more efficient algorithm and give empirical results on that. I'm not sure about the relevance of the Stochastic Network Design Problem at NIPS, but given that it generalizes the Influence Maximization problem, there should be interest.