{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article7852","name":"Computational Aspects of the Colorful Carath\u00e9odory Theorem","abstract":"Let P_1,...,P_{d+1} be d-dimensional point sets such that the convex hull of each P_i contains the origin. We call the sets P_i color classes, and we think of the points in P_i as having color i. A colorful choice is a set with at most one point of each color. The colorful Caratheodory theorem guarantees the existence of a colorful choice whose convex hull contains the origin. So far, the computational complexity of finding such a colorful choice is unknown.\r\n\r\nWe approach this problem from two directions. First, we consider approximation algorithms: an m-colorful choice is a set that contains at most m points from each color class. We show that for any fixed epsilon > 0, an (epsilon d)-colorful choice containing the origin in its convex hull can be found in polynomial time. This notion of approximation has not been studied before, and it is motivated through the applications of the colorful Caratheodory theorem in the literature. In the second part, we present a natural generalization of the colorful Caratheodory problem: in the Nearest Colorful Polytope problem (NCP), we are given d-dimensional point sets P_1,...,P_n that do not necessarily contain the origin in their convex hulls. The goal is to find a colorful choice whose convex hull minimizes the distance to the origin. We show that computing local optima for the NCP problem is PLS-complete, while computing a global optimum is NP-hard.","keywords":["colorful Carath\u00e9odory theorem","high-dimensional approximation","PLS"],"author":[{"@type":"Person","name":"Mulzer, Wolfgang","givenName":"Wolfgang","familyName":"Mulzer"},{"@type":"Person","name":"Stein, Yannik","givenName":"Yannik","familyName":"Stein"}],"position":7,"pageStart":44,"pageEnd":58,"dateCreated":"2015-06-12","datePublished":"2015-06-12","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Mulzer, Wolfgang","givenName":"Wolfgang","familyName":"Mulzer"},{"@type":"Person","name":"Stein, Yannik","givenName":"Yannik","familyName":"Stein"}],"copyrightYear":"2015","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.SOCG.2015.44","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6237","volumeNumber":34,"name":"31st International Symposium on Computational Geometry (SoCG 2015)","dateCreated":"2015-06-12","datePublished":"2015-06-12","editor":[{"@type":"Person","name":"Arge, Lars","givenName":"Lars","familyName":"Arge"},{"@type":"Person","name":"Pach, J\u00e1nos","givenName":"J\u00e1nos","familyName":"Pach"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article7852","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6237"}}}