Smoothed analysis of local search algorithms
From MaRDI portal
Recommendations
Cites work
- A quantization framework for smoothed analysis of Euclidean optimization problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Approximating independent set in perturbed graphs
- Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
- Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method
- Equilibria with Communication in a Job Market Example
- scientific article; zbMATH DE number 2119754 (Why is no real title available?)
- Internet routing between autonomous systems: fast algorithms for path trading
- Learning and Smoothed Analysis
- Lower bounds for the average and smoothed number of Pareto-optima
- Mathematical Foundations of Computer Science 2003
- Modeling language evolution
- New Results on the Old k-opt Algorithm for the Traveling Salesman Problem
- On smoothed \(k\)-CNF formulas and the \texttt{Walksat} algorithm
- On smoothed analysis in dense graphs and formulas
- On smoothed analysis of quicksort and Hoare's find
- Performance guarantees for scheduling algorithms under perturbed machine speeds
- Polynomial approximation schemes for smoothed and random instances of multidimensional packing problems
- Random knapsack in expected polynomial time
- Settling the complexity of computing two-player Nash equilibria
- Settling the complexity of local max-cut (almost) completely
- Smooth analysis of the condition number and the least singular value
- Smoothed analysis of algorithms
- Smoothed analysis of belief propagation for minimum-cost flow and matching
- Smoothed analysis of binary search trees
- Smoothed analysis of complex conic condition numbers
- Smoothed analysis of condition numbers and complexity implications for linear programming
- Smoothed analysis of integer programming
- Smoothed analysis of left-to-right maxima with applications
- Smoothed Analysis of Local Search for the Maximum-Cut Problem
- Smoothed Analysis of Multiobjective Optimization
- Smoothed analysis of partitioning algorithms for Euclidean functionals
- Smoothed analysis of probabilistic roadmaps
- Smoothed analysis of termination of linear programming algorithms
- Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise
- Smoothed analysis of the k-means method
- Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
- Smoothed analysis of the minimum-mean cycle canceling algorithm and the network simplex algorithm
- Smoothed analysis of the successive shortest path algorithm
- Smoothed performance guarantees for local search
- The diameter of randomly perturbed digraphs and some applications
- The probability that a slightly perturbed numerical analysis problem is difficult
- The smoothed complexity of edit distance
- The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
- Topology matters: smoothed competitiveness of metrical task systems
- Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic
- Visibility maps of realistic terrains have linear smoothed complexity
- Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP
- Worst-case and smoothed analysis of \(k\)-means clustering with Bregman divergences
Cited in
(12)- Smoothed Performance Guarantees for Local Search
- Smoothed analysis of algorithms and heuristics: progress and open questions
- Smoothed performance guarantees for local search
- scientific article; zbMATH DE number 1256747 (Why is no real title available?)
- Smoothed analysis of local search for the maximum-cut problem
- Smoothed Analysis of Local Search
- Smoothed Analysis of Local Search for the Maximum-Cut Problem
- Mathematical Foundations of Computer Science 2003
- Fundamentals of Computation Theory
- scientific article; zbMATH DE number 2226659 (Why is no real title available?)
- Local optima smoothing for global optimization
- Smoothed analysis of the k-swap neighborhood for makespan scheduling
This page was built for publication: Smoothed analysis of local search algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449848)
