Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
teaching:ss17:seminar-advancedalgoii [2017/04/21 15:52]
toennis
teaching:ss17:seminar-advancedalgoii [2017/04/22 20:54]
roeglin [General Information]
Line 13: Line 13:
   * Tengyu Ma et al.: [[http://​drops.dagstuhl.de/​opus/​volltexte/​2013/​3958/​pdf/​46.pdf|The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems]]   * Tengyu Ma et al.: [[http://​drops.dagstuhl.de/​opus/​volltexte/​2013/​3958/​pdf/​46.pdf|The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems]]
   * Anupam Gupta and Marco Molinaro: [[https://​pdfs.semanticscholar.org/​a698/​386495956611065e2be4a39ba425901e0a41.pdf|How Experts Can Solve LPs Online]]   * Anupam Gupta and Marco Molinaro: [[https://​pdfs.semanticscholar.org/​a698/​386495956611065e2be4a39ba425901e0a41.pdf|How Experts Can Solve LPs Online]]
 +  * Sanjoy Dasgupta: [[http://​doi.acm.org/​10.1145/​2897518.2897527|A cost function for similarity-based hierarchical clustering]]
 +  * Sanjoy Dasgupta and Philip M. Long: [[http://​dx.doi.org/​10.1016/​j.jcss.2004.10.006|Performance guarantees for hierarchical clustering]]
 +  * Liberty et al.: [[http://​epubs.siam.org/​doi/​10.1137/​1.9781611974317.7|An Algorithm for Online K-Means Clustering]]
 +

Page Tools