An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation · HackerPapers discussions

An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation — mentioned by sxv

Tue, 10 Jul 2018 17:17:47 GMT

More recent IEEE post [0] links to a different version of the paper [1] than the arxiv preprint linked in previous comments [2]. [0] https://spectrum.ieee.org/tech-talk/computing/software/new-o... [1] https://scholar.harvard.edu/files/ericbalkanski/files/the-ad... [2] https://arxiv.org/pdf/1804.06355.pdf

Paper and discussion history. A mention is not an endorsement.

An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation — mentioned by tzs

Tue, 03 Jul 2018 14:59:58 GMT

abstract: https://arxiv.org/abs/1804.06355

Paper and discussion history. A mention is not an endorsement.

An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation — mentioned by Barjak

Tue, 03 Jul 2018 14:50:23 GMT

I think it's arXiv:1804.06355 "An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation"

Paper and discussion history. A mention is not an endorsement.

An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation — mentioned by MaxBarraclough

Tue, 03 Jul 2018 14:47:11 GMT

I don't think that's it. That's one of Singer's earlier works. I'm fairly sure the relevant one is https://arxiv.org/pdf/1804.06355.pdf (listed as 'under submission' at https://people.seas.harvard.edu/~yaron/papers.html , in line with the article's description)

Paper and discussion history. A mention is not an endorsement.

An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation — mentioned by MaxBarraclough

Tue, 03 Jul 2018 14:42:58 GMT

https://arxiv.org/pdf/1804.06355.pdf

Paper and discussion history. A mention is not an endorsement.

An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation — mentioned by ajb

Sun, 01 Jul 2018 10:33:08 GMT

The article doesn't even mention NP-completeness. Nor does the paper: https://arxiv.org/pdf/1804.06355.pdf Haven't read enough yet to comment otherwise, but let's not spread rumours.

Paper and discussion history. A mention is not an endorsement.

An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation — mentioned by westurner

Sun, 01 Jul 2018 02:28:10 GMT

"An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation" 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 https://scholar.harvard.edu/files/ericbalkanski/files/the-ad... A DOI URI would be great, thanks.

Paper and discussion history. A mention is not an endorsement.

An Exponential Speedup in Parallel Running Time for Submodular Maximization without Loss in Approximation — mentioned by mindcrime

Sun, 01 Jul 2018 01:24:33 GMT

Looks like it may be this paper: https://arxiv.org/pdf/1804.06355

Paper and discussion history. A mention is not an endorsement.