Author:
Bansal Vikas,der Heide Friedhelm Meyer auf,Sohler Christian
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Appel, M., Russo, R.: The Maximum Vertex Degree of a Graph on Uniform Points in [0, 1] d . Adv. Appl. Prob., 567–581 (1997)
2. Appel, M., Russo, R.: The connectivity of a graph on uniform points in [0, 1] d . Statistics and Probability Letters 60, 351–357
3. Banderier, C., Mehlhorn, K., Beier, R.: Smoothed Analysis of Three Combinatorial Problems. In: Proc. of the 28th International Symposium on Mathematical Foundations of Computer Science, pp. 198–207 (2003)
4. Becchetti, L., Leonardi, S., Marchetti-Spaccamela, A., Schäfer, G., Vredeveld, T.: Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. In: Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 462–471 (2003)
5. Beier, R., Vöcking, B.: Typical Properties of Winners and Losers in Discrete Optimization. In: Proc. of the 36th Annual ACM Symposium on Theory of Computing, pp. 343–352 (2004)