On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems

Christian Knauer, Hans Raj Tiwary, Daniel Werner. On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems. In Thomas Schwentick, Christoph Dürr, editors, 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany. Volume 9 of LIPIcs, pages 649-660, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2011. [doi]

Abstract

Abstract is missing.