Fetching the paper…
Reading the bibliography…
We obtain algorithms for computing Tverberg partitions based on centerpoint approximations.
C. Carathéodory, Über den Variabilitätsbereich der Koeffizienten von Potenzreihen, die gegebene Werte nicht annehmen , Math. Ann. 64
1907
Earlier work this paper cites.
J. Radon, Mengen konvexer Körper, die einen gemeinsamen Punkt enthalten , Math. Ann. 83
1921
Earlier work this paper cites.
R. Rado, A theorem on general measure , J. London Math. Soc. 1
1946
Earlier work this paper cites.
H. Tverberg, A generalization of Radon’s theorem , J. London Math. Soc. 41
1966
Earlier work this paper cites.
J. Eckhoff, Der Satz von Radon in Konvexen Produktstrukturen. I , Monatsh. Math. 72
1968
Earlier work this paper cites.
J. P. Doignon, Convexity in cristallographical lattices , J. Geom. 3
1973
Earlier work this paper cites.
H. E. Scarf, An observation on the structure of production sets with indivisibilities , Proc. Nat. Acad. Sci. 74
1977
Earlier work this paper cites.
I. Bárány, S. B. Shlosman, and A. Szücs, On a topological generalization of a theorem of Tverberg , J. London Math. Soc. 2
1981
Earlier work this paper cites.
R. Jamison, Partition numbers for trees and ordered sets , Pacific J. Math. 96
1981
Earlier work this paper cites.
S. Onn, On the geometry and computational complexity of Radon partitions in the integer lattice , SIAM J. Discrete Math. 4
1991
Earlier work this paper cites.
I. Bárány and D. G. Larman, A colored version of Tverberg’s theorem , J. London Math. Soc. s2-45
1992
Earlier work this paper cites.
by same author, Helly, Radon, and Carathéodory type theorems , Handbook of convex geometry, Vol. A, B, North-Holland, Amsterdam, 1993, pp. 389–448
1993
Cited alongside, same era.
M. L. J. van de Vel, Theory of convex structures , North-Holland Mathematical Library, vol. 50, North-Holland Publishing Co., Amsterdam, 1993. MR 1234493 (95a:52002)
1993
Cited alongside, same era.
K. L. Clarkson, D. Eppstein, G. L. Miller, C. Sturtivant, and S.-H. Teng, Approximating center points with iterative Radon points , Internat. J. Comput. Geom. Appl. 6
1996
Cited alongside, same era.
A.Y. Volovikov, On a topological generalization of the Tverberg theorem , Math Notes 59
1996
Cited alongside, same era.
Pierre Duchet, Discrete convexity: retractions, morphisms and the partition problem , Proceedings of the conference on graph connections, India, 1998, pp. 10–18
1998
P. Soberón and R. Strausz, A generalisation of Tverberg’s theorem , Discrete Comput. Geom. 47
2012
Later among the works it cites.
Mitre Costa Dourado, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá, and Jayme Luiz Szwarcfiter, On the geodetic Radon number of grids , Discrete Mathematics 313
2013
Later among the works it cites.
by same author, Polynomial time algorithm for the Radon number of grids in the geodetic convexity. , Electronic Notes in Discrete Mathematics 44
2013
Later among the works it cites.
W. Mulzer and D. Werner, Approximating tverberg points in linear time for any fixed dimension , Discrete Comput. Geom. 50
2013
Later among the works it cites.
W. Mulzer and Y. Stein, Algorithms for tolerant tverberg partitions , Internat. J. Comput. Geom. Appl. 24
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
by same author, The partition conjecture , Discrete Math. 221
2000
Cited alongside, same era.
V. Borozan and G. Cornuéjols, Minimal valid inequalities for integer constraints , Math. Oper. Res. 34
2009
Cited alongside, same era.
B. Bukh, Radon partitions in convexity spaces , arXiv preprint arXiv:1009.2384 (2010)
2010
Cited alongside, same era.
G. L. Miller and D. R. Sheehy, Approximate centerpoints with proofs , Comput. Geom. 43
2010
Cited alongside, same era.
P. V. M. Blagojević, B. Matschke, and G. M. Ziegler, Optimal bounds for a colorful Tverberg-Vrećica type problem , Adv. Math. 226
2011
Cited alongside, same era.
F. Cicalese and M. Milanič, Graphs of separability at most 2 , Discrete Applied Mathematics 160
2012
Cited alongside, same era.
2015
Later among the works it cites.
by same author, Optimal bounds for the colored Tverberg problem , J. Eur. Math. Soc. (JEMS) 17
2015
Later among the works it cites.
E. M. M. Coelho, M. C. Dourado, and R. M. Sampaio, Inapproximability results for graph convexity parameters , Theoret. Comput. Sci. 600
2015
Later among the works it cites.
P. Soberón, Equal coefficients and tolerance in coloured Tverberg partitions , Combinatorica 35
2015
Later among the works it cites.
J. A. De Loera, R. N. La Haye, D. Rolnick, and P. Soberón, Quantitative tverberg theorems over lattices and other discrete sets , Discrete Comput. Geom. 58
2017
Closest in time.