Polynomial-Sized Topological Approximations Using the Permutahedron

Choudhary, Aruni; Kerber, Michael; Raghvendra, Sharat

doi:10.4230/LIPIcs.SoCG.2016.31

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Polynomial-Sized Topological Approximations Using the Permutahedron

MPS-Authors

/persons/resource/persons129030

Choudhary, Aruni
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44759

Kerber, Michael
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2016/5923/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Copyright transfer agreement)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

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. Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.SoCG.2016.31.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002B-025D-1

Abstract

There is no abstract available