Pages that link to "Item:Q5891192"
From MaRDI portal
The following pages link to Approximating Tverberg points in linear time for any fixed dimension (Q5891192):
Displaying 12 items.
- Computational aspects of the colorful Carathéodory theorem (Q1991350) (← links)
- Resilient distributed vector consensus using centerpoint (Q2063807) (← links)
- No-dimensional Tverberg theorems and algorithms (Q2105318) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- Tverberg’s theorem is 50 years old: A survey (Q4684365) (← links)
- Tverberg theorems over discrete sets of points (Q4998740) (← links)
- Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data (Q5037559) (← links)
- (Q5088968) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS (Q5261015) (← links)
- Algorithms for Radon partitions with tolerance (Q5918766) (← links)
- Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey (Q6073106) (← links)
