Fetching the paper…
Reading the bibliography…
Let $C_1,\dots,C_{d+1}\subset \mathbb{R}^d$ be $d+1$ point sets, each containing the origin in its convex hull.
Über Tchebychefsche Annäherungsmethoden
P. Kirchberger · 1903
Earlier work this paper cites.
A theorem on general measure
R. Rado · 1946
Earlier work this paper cites.
A generalization of Radon’s theorem
H. Tverberg · 1966
Earlier work this paper cites.
Time bounds for selection
M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan · 1973
Earlier work this paper cites.
The polynomial solvability of convex quadratic programming
M. K. Kozlov, S. P. Tarasov, and L. G. Khachiyan · 1980
Earlier work this paper cites.
A generalization of Radon’s theorem II
H. Tverberg · 1981
Earlier work this paper cites.
A generalization of Carathéodory’s theorem
I. Bárány · 1982
Earlier work this paper cites.
Computational geometry
F. P. Preparata and M. I. Shamos · 1985
Earlier work this paper cites.
Fast algorithms for convex quadratic programming and multicommodity flows
S. Kapoor and P. M. Vaidya · 1986
Earlier work this paper cites.
How easy is local search?
D. S. Johnson, C. H. Papadimitriou, and M. Yannakakis · 1988
Earlier work this paper cites.
On total functions, existence theorems and computational complexity
N. Megiddo and C. H. Papadimitriou · 1991
Earlier work this paper cites.
Simple local search problems that are hard to solve
A. A. Schäffer and M. Yannakakis · 1991
Cited alongside, same era.
Points, Spheres, and Separators: A Unified Geometric Approach to Graph Partitioning
S.-H. Teng · 1991
Cited alongside, same era.
The complexity of the Lin-Kernighan heuristic for the traveling salesman problem
C. H. Papadimitriou · 1992
Cited alongside, same era.
Tverberg’s theorem via number fields
K. S. Sarkaria · 1992
Cited alongside, same era.
On generalizations of Radon’s theorem and the ham sandwich theorem
H. Tverberg and S. Vrećica · 1993
Cited alongside, same era.
Computing a centerpoint of a finite planar set of points in linear time
S. Jadhav and A. Mukhopadhyay · 1994
Cited alongside, same era.
An optimal randomized algorithm for maximum Tukey depth
T. M. Chan · 2004
Later among the works it cites.
The complexity of pure Nash equilibria
A. Fabrikant, C. H. Papadimitriou, and K. Talwar · 2004
Later among the works it cites.
Theoretical aspects of local search
W. Michiels, E. Aarts, and J. Korst · 2007
Later among the works it cites.
Very colorful theorems
J. L. Arocha, I. Bárány, J. Bracho, R. Fabila, and L. Montejano · 2009
Later among the works it cites.
Approximate centerpoints with proofs
G. L. Miller and D. R. Sheehy · 2010
Later among the works it cites.
A further generalization of the colourful Carathéodory theorem
F. Meunier and A. Deza · 2013
Later among the works it cites.
Approximating Tverberg points in linear time for any fixed dimension
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Colourful linear programming and its relatives
I. Bárány and S. Onn · 1997
Cited alongside, same era.
Partitions of points into simplices with
J.-P. Roudneff · 2001
Cited alongside, same era.
Lectures on discrete geometry
J. Matoušek · 2002
Cited alongside, same era.
Local search in combinatorial optimization
E. Aarts and J. K. Lenstra · 2003
Cited alongside, same era.
W. Mulzer and D. Werner · 2013
Later among the works it cites.
Colorful linear programming, Nash equilibrium, and pivots
F. Meunier and P. Sarrabezolles · 2014
Closest in time.
Approximating Nash equilibria and dense bipartite subgraphs via an approximate version of Carathéodory’s theorem
S. Barman · 2015
Closest in time.
The rainbow at the end of the line — a PPAD formulation of the colorful Carathéodory theorem with applications
F. Meunier, W. Mulzer, P. Sarrabezolles, and Y. Stein · 2017
Closest in time.