Skip to main content
Article thumbnail
Location of Repository

Approximate centerpoints with proofs

By Gary L. Miller and Donald R. Sheehy

Abstract

We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ R d with running time subexponential in d. The algorithm is a derandomization of the IteratedRadon algorithm of Clarkson et al and is guaranteed to terminate with an O(1/d 2)-center. Moreover, it returns a polynomial-time checkable proof of the approximation guarantee, despite the coNP-Completenes of testing centerpoints in general. We also explore the use of higher order Tverberg partitions to improve the runtime of the deterministic algorithm and improve the approximation guarantee for the randomized algorithm. In particular, we show how to improve the O(1/d 2)-center of the IteratedRadon algorithm to O(1/d r r−1) for a cost of O((rd) d) in time for any integer r> 1.

Year: 2010
OAI identifier: oai:CiteSeerX.psu:10.1.1.418.5359
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.cmu.edu/~dsheehy... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.