Author:
Elsässer Robert,Tscheuschner Tobias
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Arthur, D., Manthey, B., Röglin, H.: k-Means has polynomial smoothed complexity. In: FOCS 2009, pp. 405–414 (2009)
2. Ackermann, H., Röglin, H., Vöcking, B.: On the impact of combinatorial structure on congestion games. Journal of the ACM (JACM) 55(6), art. 25 (2008)
3. Blum, A., Dunagan, J.: Smoothed analysis of the perceptron algorithm for linear programming. In: SODA, pp. 905–914 (2002)
4. Beier, R., Vöcking, B.: Typical properties of winners and losers in discrete optimization. In: STOC, pp. 343–352 (2004)
5. Englert, M., Röglin, H., Vöcking, B.: Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP. In: SODA, pp. 1295–1304 (2006)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献