ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
From MaRDI portal
Publication:5261015
Recommendations
- Algorithms for tolerated Tverberg partitions
- Improved Approximation Algorithms for Tverberg Partitions
- An algorithm for nontransitive partitions
- Algorithms for non-crossing partitions
- Tolerance for colorful Tverberg partitions
- Algorithms for partition of some class of graphs under compaction
- scientific article; zbMATH DE number 1161371
- An exact algorithm for graph partitioning
- Algorithms for constructing the shortest allowable partitions of finite sets
Cites work
- A Generalization of Radon's Theorem
- A Theorem on General Measure
- A generalisation of Tverberg's theorem
- APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
- Approximate centerpoints with proofs
- Approximating Tverberg points in linear time for any fixed dimension
- Lawrence oriented matroids and a problem of McMullen on projective equivalences of polytopes
- On Sets Projectively Equivalent to the Vertices of a Convex Polytope
- Tolerance in Helly-type theorems
- Tverberg's theorem via number fields
Cited in
(14)- Extensions of the colorful Helly theorem for d-collapsible and d-Leray complexes
- No-dimensional Tverberg theorems and algorithms
- Algorithms for tolerated Tverberg partitions
- Tolerance for colorful Tverberg partitions
- New lower bounds for Tverberg partitions with tolerance in the plane
- A note on the Tolerant Tverberg Theorem
- Horizontal partitions and Kleshchev's algorithm
- Algorithms for Radon partitions with tolerance
- Tverberg’s theorem is 50 years old: A survey
- scientific article; zbMATH DE number 5492159 (Why is no real title available?)
- Approximating Tverberg points in linear time for any fixed dimension
- Algorithms for Radon partitions with tolerance
- No-dimensional Tverberg Theorems and Algorithms
- Approximating Tverberg points in linear time for any fixed dimension
This page was built for publication: ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261015)