scientific article; zbMATH DE number 6789180

DOI10.4230/LIPICS.SOCG.2015.44MaRDI QIDQ5368675zbMATH OpenFDO

Authors Wolfgang Mulzer, Yannik Stein

Publication date 10 October 2017

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2015.44

zbMATH Keywords

colorful Carathéodory theoremhigh-dimensional approximationPLS

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Computational aspects related to convexity (52B55) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Computational aspects of the colorful Carathéodory theorem
• An optimal generalization of the colorful Carathéodory theorem
• A further generalization of the colourful Carathéodory theorem
• scientific article; zbMATH DE number 940709
• The computation of chromatic polynomials
• scientific article; zbMATH DE number 1054763
• A note on computable distinguishing colorings
• scientific article; zbMATH DE number 6724468

Cited in

(6)

• Computational aspects of the colorful Carathéodory theorem
• The rainbow at the end of the line -- a \textsf{PPAD} formulation of the colorful Carathéodory theorem with applications
• Robust Tverberg and Colourful Carathéodory Results via Random Choice
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• scientific article; zbMATH DE number 6724468 (Why is no real title available?)
• An optimal generalization of the colorful Carathéodory theorem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368675)