### Abstract

We describe a deterministic polynomial-time algorithm which, for a convex body K in Euclidean n-space, finds upper and lower bounds on K's diameter which differ by a factor of O(√n/log n). We show that this is, within a constant factor, the best approximation to the diameter that a polynomial-time algorithm can produce even if randomization is allowed. We also show that the above results hold for other quantities similar to the diameter - namely, inradius, circumradius, width, and maximization of the norm over K. In addition to these results for Euclidean spaces, we give tight results for the error of deterministic polynomial-time approximations of radii and norm-maxima for convex bodies in finite-dimensional l_{p} spaces.

Original language | English |
---|---|

Pages (from-to) | 244-251 |

Number of pages | 8 |

Journal | Annual Symposium on Foundations of Computer Science - Proceedings |

Publication status | Published - Dec 1 1998 |

Event | Proceedings of the 1998 39th Annual Symposium on Foundations of Computer Science - Palo Alto, CA, USA Duration: Nov 8 1998 → Nov 11 1998 |

### ASJC Scopus subject areas

- Hardware and Architecture

## Fingerprint Dive into the research topics of 'Approximation of diameters: Randomization doesn't help'. Together they form a unique fingerprint.

## Cite this

*Annual Symposium on Foundations of Computer Science - Proceedings*, 244-251.