ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS

DOI10.1142/S0218195914600073zbMATH Open1336.52006OpenAlexW3105357693MaRDI QIDQ5261015FDOQ5261015

Authors: Wolfgang Mulzer, Yannik Stein 

Publication date: 1 July 2015

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195914600073

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

zbMATH Keywords

coNP-completenessTverberg partitionhigh-dimensional approximationtolerant Tverberg partition

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Helly-type theorems and geometric transversal theory (52A35)

Cites Work

• A generalisation of Tverberg's theorem
• A Generalization of Radon's Theorem
• A Theorem on General Measure
• APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
• Approximate centerpoints with proofs
• Tverberg's theorem via number fields
• On Sets Projectively Equivalent to the Vertices of a Convex Polytope
• Lawrence oriented matroids and a problem of McMullen on projective equivalences of polytopes
• Tolerance in Helly-type theorems
• Approximating Tverberg points in linear time for any fixed dimension

Cited In (10)

• No-dimensional Tverberg theorems and algorithms
• Tolerance for colorful Tverberg partitions
• New lower bounds for Tverberg partitions with tolerance in the plane
• Horizontal partitions and Kleshchev's algorithm
• A note on the Tolerant Tverberg Theorem
• Tverberg’s theorem is 50 years old: A survey
• Title not available (Why is that?)
• Algorithms for Radon partitions with tolerance
• Approximating Tverberg points in linear time for any fixed dimension
• Extensions of the colorful Helly theorem for d-collapsible and d-Leray complexes

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)