The following pages link to Smoothed analysis of algorithms (Q5175982):
Displayed 11 items.
- Core instances for testing: a case study (Q1779532) (← links)
- Probabilistic analysis of complex Gaussian elimination without pivoting (Q1827483) (← links)
- On the Complexity of the Metric TSP under Stability Considerations (Q3075531) (← links)
- A Probabilistic PTAS for Shortest Common Superstring (Q3182960) (← links)
- On smoothed analysis in dense graphs and formulas (Q3419587) (← links)
- How many random edges make a dense hypergraph non-2-colorable? (Q3503605) (← links)
- Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms (Q3503606) (← links)
- The interior-point revolution in optimization: History, recent developments, and lasting consequences (Q4829921) (← links)
- The diameter of randomly perturbed digraphs and some applications (Q5297137) (← links)
- Expansion and Lack Thereof in Randomly Perturbed Graphs (Q5900217) (← links)
- Random knapsack in expected polynomial time (Q5917572) (← links)