Author:
Röglin Heiko,Vöcking Berthold
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Banderier, C., Beier, R., Mehlhorn, K.: Smoothed Analysis of Three Combinatorial Problems. In: Proc. 28th International Symposium on Mathematical Foundations of Computer Science (MFCS-2003), vol. 97, pp. 198–207 (2003)
2. Beier, R., Vöcking, B.: An Experimental Study of Random Knapsack Problems. In: Proc. of the 12th Annual European Symposium on Algorithms (ESA-2004), pp. 616–627 (2004)
3. Beier, R., Vöcking, B.: Probabilistic Analysis of Knapsack Core Algorithms. In: Proc. of the 15th Annual Symposium on Discrete Algorithms (SODA-2004), New Orleans, USA, pp. 468–477 (2004)
4. Beier, R., Vöcking, B.: Random Knapsack in Expected Polynomial Time. Journal of Computer and System Sciences 69(3), 306–329 (2004)
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 (STOC-2004), pp. 343–352 (2004)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献