Some Algorithmic Problems in Polytope Theory
Combinatorics
2007-05-23 v1 Metric Geometry
Abstract
This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The problems are grouped into the sections ``Coordinate Descriptions'', ``Combinatorial Structure'', ``Isomorphism'', ``Optimization'', ``Realizability'', and ``Beyond Polytopes''.
Keywords
Cite
@article{arxiv.math/0202204,
title = {Some Algorithmic Problems in Polytope Theory},
author = {Volker Kaibel and Marc E. Pfetsch},
journal= {arXiv preprint arXiv:math/0202204},
year = {2007}
}