A Subexponential Algorithm for Abstract Optimization Problems
From MaRDI portal
Publication:4857592
DOI10.1137/S0097539793250287zbMath0836.68044MaRDI QIDQ4857592
Publication date: 11 April 1996
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539793250287
68Q25: Analysis of algorithms and problem complexity
90C25: Convex programming
90C27: Combinatorial optimization
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W10: Parallel algorithms in computer science
Related Items
THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS, ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS, Unnamed Item, Clarkson's algorithm for violator spaces, Practical methods for shape fitting and kinetic data structures using coresets, Finding the projection on a polytope: An iterative method, Linear programming, the simplex algorithm and simple polytopes, A subexponential bound for linear programming, Random edge can be exponential on abstract cubes, Helly’s theorem: New variations and applications, APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING