The following pages link to Smoothed analysis of algorithms (Q3583576):
Displaying 12 items.
- Adversarial meta-learning of Gamma-minimax estimators that leverage prior knowledge (Q6184868) (← links)
- Linear optimization with the shadow vertex algorithm in the context of probabilistic analyses. Studies on the transition from phase 1 to phase 2 in the average-case analysis and in the smoothing analysis of the simplex method (Q6486814) (← links)
- Models of smoothing in dynamic networks (Q6535035) (← links)
- Circuits in extended formulations (Q6564188) (← links)
- Approximation ineffectiveness of a tour-untangling heuristic (Q6574920) (← links)
- The simultaneous semi-random model for TSP (Q6589752) (← links)
- The square of a Hamilton cycle in randomly perturbed graphs (Q6596386) (← links)
- The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability (Q6599765) (← links)
- Smoothed analysis of social choice revisited (Q6609149) (← links)
- Schur properties of randomly perturbed sets (Q6612519) (← links)
- Posets arising as 1-skeleta of simple polytopes, the nonrevisiting path conjecture, and poset topology (Q6642295) (← links)
- A spectral approach to polytope diameter (Q6642303) (← links)
