2 ms·
Looks like it may be this paper: https://arxiv.org/pdf/1804.06355 https://arxiv.org/pdf/1804.06355
by mindcrime 8y ago
Looks like it may be this paper:
https://arxiv.org/pdf/1804.06355 https://arxiv.org/pdf/1804.06355
- westurner 8y ago"An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation" https://www.arxiv-vanity.com/papers/1804.06355/ https://www.arxiv-vanity.com/papers/1804.06355/ The ACM STOC 2018 conference links to "The Adaptive Complexity of Maximizing a Submodular Function" http://dl.acm.org/authorize?N651970 http://dl.acm.org/authorize?N651970 https://scholar.harvard.edu/files/ericbalkanski/files/the-adaptive-complexity-of-maximizing-a-submodular-function.pdf https://scholar.harvard.edu/files/ericbalkanski/files/the-ad... A DOI URI would be great, thanks.
- spruciefic399 8y agoReading through that paper I'm not sure exactly what's new about it above and beyond what has been in a lot of the evolutionary algorithm literature, other than maybe formal proofs (which would be important). I'm sure I'm missing something though because this isn't my area.