Pareto Optimal Solutions for Smoothed Analysts
From MaRDI portal
Publication:4907582
DOI10.1137/110851833zbMath1263.90089arXiv1011.2249OpenAlexW2568203473MaRDI QIDQ4907582
Publication date: 4 February 2013
Published in: SIAM Journal on Computing, Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.2249
Analysis of algorithms and problem complexity (68Q25) Multi-objective and goal programming (90C29) Boolean programming (90C09) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (6)
Smoothed Analysis of Local Search Algorithms ⋮ Smoothed analysis for tensor methods in unsupervised learning ⋮ Efficient Fair Division with Minimal Sharing ⋮ The smoothed number of Pareto-optimal solutions in bicriteria integer optimization ⋮ The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization ⋮ Improved smoothed analysis of multiobjective optimization
This page was built for publication: Pareto Optimal Solutions for Smoothed Analysts