Confirmed users
1,209
edits
Webdev:Meetings:2012-05-22: Difference between revisions
→wenzel
m (→Open Items) |
(→wenzel) |
||
| Line 57: | Line 57: | ||
== tofumatt == | == tofumatt == | ||
== wenzel == | == wenzel == | ||
* Lots of recruiting work | |||
* newnewtab project planning | |||
* Marketplace submission API planning | |||
Favorite algorithm is the efficient solution to the Traveling Salesman Problem that I am surely going to come up with any day now. Oh, *existing* algorithms. I like [http://en.wikipedia.org/wiki/Minimum_spanning_tree MST] for its simplicity. | |||
== wil == | == wil == | ||
== willkg == | == willkg == | ||