DeepAI AI Chat
Log In Sign Up

Improved Approximation Algorithms for Tverberg Partitions

by   Sariel Har-Peled, et al.
University of Illinois at Urbana-Champaign

Tverberg's theorem states that a set of n points in ^d can be partitioned into n/(d+1) sets with a common intersection. A point in this intersection (aka Tverberg point) is a centerpoint of the input point set, and the Tverberg partition provides a compact proof of this, which is algorithmically useful. Unfortunately, computing a Tverberg point exactly requires n^O(d^2) time. We provide several new approximation algorithms for this problem, which improve either the running time or quality of approximation, or both. In particular, we provide the first strongly polynomial (in both n and d) approximation algorithm for finding a Tverberg point.


page 1

page 2

page 3

page 4


Approximation Algorithms for Maximum Matchings in Geometric Intersection Graphs

We present a (1- ε)-approximation algorithms for maximum cardinality mat...

Better approximation algorithm for point-set diameter

We propose a new (1+O(ε))-approximation algorithm with O(n+ 1/ε^(d-1)/2)...

A (4/3+ε)-Approximation Algorithm for Arboricity From Pseudoforest Partitions

The arboricity of a graph is the minimum number of forests it can be par...

Tverberg-Type Theorems with Trees and Cycles as (Nerve) Intersection Patterns

Tverberg's theorem says that a set with sufficiently many points in R^d ...

Classifying Approximation Algorithms: Understanding the APX Complexity Class

We are interested in the intersection of approximation algorithms and co...

Barnes-Hut Approximation for Point SetGeodesic Shooting

Geodesic shooting has been successfully applied to diffeo-morphic regist...

Approximation Algorithms for Cascading Prediction Models

We present an approximation algorithm that takes a pool of pre-trained m...