On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension

Bernard Chazelle, Jiří Matoušek

Research output: Contribution to journalArticle

101 Scopus citations

Abstract

We show that with recently developed derandomization techniques, one can convert Clarkson's randomized algorithm for linear programming in fixed dimension into a linear-time deterministic algorithm. The constant of proportionality is d O(d) , which is better than those for previously known algorithms. We show that the algorithm works in a fairly general abstract setting, which allows us to solve various other problems, e.g., computing the minimum-volume ellipsoid enclosing a set of n points and finding the maximum volume ellipsoid in the intersection of n halfspaces.

Original languageEnglish (US)
Pages (from-to)579-597
Number of pages19
JournalJournal of Algorithms
Volume21
Issue number3
DOIs
StatePublished - Jan 1 1996

All Science Journal Classification (ASJC) codes

  • Control and Optimization
  • Computational Mathematics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension'. Together they form a unique fingerprint.

  • Cite this