Pages that link to "Item:Q991175"
From MaRDI portal
The following pages link to Approximate centerpoints with proofs (Q991175):
Displaying 22 items.
- Approximate center points in dense point sets (Q287016) (← links)
- Small strong epsilon nets (Q396471) (← links)
- On strong centerpoints (Q483053) (← links)
- Multidimensional agreement in Byzantine systems (Q901876) (← links)
- An optimal extension of the centerpoint theorem (Q924064) (← links)
- Centerpoints and Tverberg's technique (Q982949) (← links)
- 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)
- The center problem via averaging method (Q2518300) (← links)
- No dice: a deterministic approach to the Cartan centroid (Q2839722) (← links)
- Upper bounds for centerlines (Q2968084) (← links)
- (Q4588196) (← links)
- Tverberg’s theorem is 50 years old: A survey (Q4684365) (← links)
- Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data (Q5037559) (← links)
- (Q5088968) (← links)
- Journey to the Center of the Point Set (Q5088971) (← links)
- Extending the centerpoint theorem to multiple points (Q5091045) (← links)
- ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS (Q5261015) (← links)
- Approximating Tverberg points in linear time for any fixed dimension (Q5891192) (← links)
- Algorithms for Radon partitions with tolerance (Q5918766) (← links)
- The crossing Tverberg theorem (Q6624180) (← links)