The following pages link to (Q2934725):
Displayed 11 items.
- Smoothed performance guarantees for local search (Q403643) (← links)
- A quantization framework for smoothed analysis of Euclidean optimization problems (Q893320) (← links)
- Average-case approximation ratio of the 2-opt algorithm for the TSP (Q1015301) (← links)
- The impact of parametrization in memetic evolutionary algorithms (Q1029357) (← links)
- Smoothed analysis of partitioning algorithms for Euclidean functionals (Q1950395) (← links)
- A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem (Q2248551) (← links)
- On smoothed analysis of quicksort and Hoare's find (Q2428694) (← links)
- Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP (Q2441587) (← links)
- Settling the Complexity of Local Max-Cut (Almost) Completely (Q3012803) (← links)
- Smoothing the Gap Between NP and ER (Q5071086) (← links)
- The Number of Flips Required to Obtain Non-crossing Convex Cycles (Q5302750) (← links)