The MathNet Korea
Information Center for Mathematical Science

논문검색

Information Center for Mathematical Science

논문검색

SIAM Journal on Computing
( Vol. 24 NO.5 / (1995))
A Subexponential Algorithm for Abstract Optimization Problems
Bernd Gartneer,
Pages. 1018-1035
Abstract
Contents 1. Introduction
2. Basics and terminology
3. Abstract optimization problems
4. Bounds for abstract optimization problems
4.1. The deterministic lower bound
4.2. The randomized upper bound
5. Discussion
Key words computational geometry, smallest enclosing ball, distance between convex polyhedra, local optimization, randomized algorithm.
Mathmatical Subject Classification 68Q20, 68Q25, 68U05, 90C25, 90