Polynomial-Sized Topological Approximations Using The Permutahedron

Aruni Choudhary, Michael Kerber, Sharath Raghvendra

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Original languageEnglish
Title of host publication32nd International Symposium on Computational Geometry (SoCG 2016)
EditorsSandor Fekete, Anna Lubiw
Place of PublicationDagstuhl, Germany
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
Number of pages16
ISBN (Electronic)978-3-95977-009-5
Publication statusPublished - 2016
EventSymposium on Computational Geometry - Tufts University, Boston, United States
Duration: 14 Jun 201618 Jun 2016

Publication series

NameLeiniz International Proceedings in Informatics
PublisherSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik
ISSN (Electronic)1868-8969


ConferenceSymposium on Computational Geometry
Abbreviated titleSoCG
CountryUnited States
Internet address

ASJC Scopus subject areas

  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)

Cite this

Choudhary, A., Kerber, M., & Raghvendra, S. (2016). Polynomial-Sized Topological Approximations Using The Permutahedron. In S. Fekete, & A. Lubiw (Eds.), 32nd International Symposium on Computational Geometry (SoCG 2016) (pp. 31:1--31:16). (Leiniz International Proceedings in Informatics; Vol. 51). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.SoCG.2016.31