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