When Greedy Algorithms are Good Enough: Submodularity and the (1 – 1/e)-Approximation – Math ∩ Programming - discu.eu

Hacker News

When Greedy Algorithms Are Good Enough (2014) http://jeremykun.com/2014/07/07/when-greedy-algorithms-are-good-enough-submodularity-and-the-1-1e-approximation/ 7 comments 23/12/2015

Reddit

I prove Erdos conjecture on arithmetic progressions. http://jeremykun.com/2014/07/07/when-greedy-algorithms-are-good-enough-submodularity-and-the-1-1e-approximation/ 73 comments 26/3/2016 math

Linking pages

Main Content – Math ∩ Programming https://jeremykun.com/main-content/ 0 comments
Reading and writing proofs – Win Vector LLC http://www.win-vector.com/blog/2016/03/reading-and-writing-proofs 0 comments

Related searches:

Search whole site: site:jeremykun.com

Search title: When Greedy Algorithms are Good Enough: Submodularity and the (1 – 1/e)-Approximation – Math ∩ Programming

See how to search.

Submit link to: