No-dimensional Tverberg theorems and algorithms
DOI10.1007/S00454-022-00380-1OpenAlexW2960997452WikidataQ113905012 ScholiaQ113905012MaRDI QIDQ2105318FDOQ2105318
Authors: Aruni Choudhary, Wolfgang Mulzer 
Publication date: 8 December 2022
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.04284
approximation algorithmTverberg theorem[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=colorful+Carath%EF%BF%BD%EF%BF%BDodory+theorem&go=Go colorful Carath��odory theorem]
Cites Work
- Algorithmic Game Theory
- A generalization of Caratheodory's theorem
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
- Partitions of points into simplices with \(k\)-dimensional intersection. I: The conic Tverberg's theorem
- A Generalization of Radon's Theorem
- A Theorem on General Measure
- Very colorful theorems
- Colourful Linear Programming and its Relatives
- An Extension of the Ham Sandwich Theorem
- Generalized sandwich theorems
- APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
- Approximate centerpoints with proofs
- The colored Tverberg's problem and complexes of injective functions
- Tverberg's theorem via number fields
- Optimal bounds for the colored Tverberg problem
- A Colored Version of Tverberg's Theorem
- A geometric proof of the colored Tverberg theorem
- Slicing convex sets and measures by a hyperplane
- Generalized ham-sandwich cuts
- A generalization of Radon's theorem II
- Equal coefficients and tolerance in coloured Tverberg partitions
- On generalizations of Radon's theorem and the Ham sandwich theorem
- On a generalization of the ham sandwich theorem
- Tverberg's Theorem at 50: Extensions and Counterexamples
- Computational aspects of the colorful Carathéodory theorem
- Theorems of Carathéodory, Helly, and Tverberg without dimension
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- The rainbow at the end of the line -- a \textsf{PPAD} formulation of the colorful Carathéodory theorem with applications
- Approximating Tverberg points in linear time for any fixed dimension
- The complexity of splitting necklaces and bisecting ham sandwiches
- Journey to the Center of the Point Set
- ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
- No-dimensional Tverberg Theorems and Algorithms
Cited In (1)
This page was built for publication: No-dimensional Tverberg theorems and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105318)
