Publication:4829029
From MaRDI portal
zbMath1058.65062MaRDI QIDQ4829029
Publication date: 29 November 2004
65K05: Numerical mathematical programming methods
90C05: Linear programming
65Y20: Complexity and performance of numerical algorithms
Related Items
Unnamed Item, A simple polynomial-time rescaling algorithm for solving linear programs, Smoothed analysis of condition numbers and complexity implications for linear programming, Some remarks on the condition number of a real random square matrix, Smoothed analysis of probabilistic roadmaps, Conditioning of random conic systems under a general family of input distributions, Computational complexity of kernel-based density-ratio estimation: a condition number analysis, Smoothed analysis of binary search trees, Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design, Smoothed Analysis on Connected Graphs, Settling the Complexity of Local Max-Cut (Almost) Completely, Smoothed Analysis of Local Search Algorithms