Next talk
Gagan Goel
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
November 5, Gates 463A, 12:30pm.
| Date | Speaker | Topic | Venue | Time |
| October 20 | Mikkel Thorup | Timeouts with time-reversed linear probing | Gates 459 | 4:00pm |
| October 29 | Ryan Williams | Graph Algorithms from Group Algebra. | Terman 453 | 12:30 pm |
| November 5 | Gagan Goel | Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions | Gates 463A | 12:30pm |
| November 12 | Ankur Moitra | Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size | Terman 453 | 12:30pm |
Founded in 1986 as the Algorithms for Lunch Bunch (AFLB), the Algorithms Seminar provides talks of general interest to the Computer Science algorithms community. Talks are usually held in Room 498 or 463A (theory lounge) in the Gates Building, near the Main Quad of Stanford's campus. The talks will usually be at 4pm on alternate Tuesdays.
If you would like to give a talk at the Stanford Algorithms Seminar, or if you have any questions, please send an email to the co-ordinators of the Algorithms Seminar, Kshipra Bhawalkar and Tim Roughgarden.
Here is the procedure to subscribe or unsubscribe to the Stanford Algorithms Seminar mailing list. If you receive theory seminar/lunch emails, you are already part of the mailing list. Otherwise, you can subscribe by sending an email to algo-seminar-join@lists.stanford.edu. To unsubscribe, send an email to algo-seminar-leave@lists.stanford.edu.