Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Optimal point placement for mesh smoothing
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Randomizing combinatorial algorithms for linear programming when the dimension is moderately high
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Explicit and implicit enforcing: randomized optimization
Computational Discrete Mathematics
Optimization over Zonotopes and Training Support Vector Machines
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Combinatorial Linear Programming: Geometry Can Help
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Finding the Sink Takes Some Time
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
The smallest enclosing ball of balls: combinatorial structure and algorithms
Proceedings of the nineteenth annual symposium on Computational geometry
Quasiconvex analysis of backtracking algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Practical methods for shape fitting and kinetic data structures using core sets
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Approximating extent measures of points
Journal of the ACM (JACM)
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
ACM Transactions on Algorithms (TALG)
Diameter of polyhedra: limits of abstraction
Proceedings of the twenty-fifth annual symposium on Computational geometry
Clarkson's algorithm for violator spaces
Computational Geometry: Theory and Applications
Diameter of Polyhedra: Limits of Abstraction
Mathematics of Operations Research
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
Proceedings of the forty-third annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
An abstract optimization problem (AOP) is a triple $(H, The algorithm is applied to the problem of finding the distance between two $n$-vertex (or $n$-facet) convex polyhedra in $d$-space, and to the computation of the smallest ball containing $n$ points in $d$-space; for both problems we give the first subexponential bounds in the arithmetic model of computation.