Author:
Röglin Heiko,Rösner Clemens
Publisher
Springer International Publishing
Reference15 articles.
1. Lecture Notes in Computer Science;R Beier,2007
2. Beier, R., Vöcking, B.: Random knapsack in expected polynomial time. J. Comput. Syst. Sci. 69(3), 306–329 (2004)
3. Brunsch, T., Goyal, N., Rademacher, L., Röglin, H.: Lower bounds for the average and smoothed number of pareto-optima. Theory Comput. 10(10), 237–256 (2014)
4. Brunsch, T., Röglin, H.: Improved smoothed analysis of multiobjective optimization. J. ACM 62(1), 4 (2015)
5. Corley, H., Moon, I.: Shortest paths in networks with vector weights. J. Optim. Theor. Appl. 46(1), 7986 (1985)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献