A Subexponential Algorithm for Abstract Optimization Problems

DOI10.1137/S0097539793250287MaRDI QIDQ4857592zbMATH OpenOpenAlexFDO

Authors B. Gärtner

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

zbMATH Keywords

abstract optimization problem

Mathematics Subject Classification ID

Convex programming (90C25) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1256684
• A combinatorial bound for linear programming and related problems
• A subexponential bound for linear programming
• Lower bounds for a subexponential optimization algorithm
• Sublinear Geometric Algorithms

Cited in

(17)

• Lower bounds for a subexponential optimization algorithm
• Practical methods for shape fitting and kinetic data structures using coresets
• On flipping edge sets in unique sink orientations
• Generalized algorithm for summing the enumerators of suboptimal solutions
• A Randomized Algorithm to Optimize Over Certain Convex Sets
• THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
• Almost optimal solutions to k-clustering problems
• Optimizations of the subresultant algorithm
• Clarkson's algorithm for violator spaces
• A subexponential bound for linear programming
• Random edge can be exponential on abstract cubes
• Helly’s theorem: New variations and applications
• Finding the projection on a polytope: An iterative method
• Exponential lower bounds for history-based simplex pivot rules on abstract cubes
• Linear programming, the simplex algorithm and simple polytopes
• APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
• scientific article; zbMATH DE number 3978823 (Why is no real title available?)

This page was built for publication: A Subexponential Algorithm for Abstract Optimization Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4857592)