Beyond the Worst-Case Analysis of Algorithms
From MaRDI portal
Publication:5118515
DOI10.1017/9781108637435zbMath1472.68009OpenAlexW4232418529MaRDI QIDQ5118515
No author found.
Publication date: 8 September 2020
Full work available at URL: https://doi.org/10.1017/9781108637435
Analysis of algorithms (68W40) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)
Related Items (8)
Siting renewable power generation assets with combinatorial optimisation ⋮ Strategyproof facility location in perturbation stable instances ⋮ The simultaneous semi-random model for TSP ⋮ A theory of composition for differential obliviousness ⋮ Beyond the worst case: semi-random complexity analysis of winner determination ⋮ Knapsack secretary through boosting ⋮ Robust Factorizations and Colorings of Tensor Graphs ⋮ Mechanism design for perturbation stable combinatorial auctions
This page was built for publication: Beyond the Worst-Case Analysis of Algorithms
