420 search results - page 1 / 84 » Some Algorithmic Problems in Polytope Theory |
DAGSTUHL
2003
13 years 6 months ago
2003
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Abstract. The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions...
COMPGEOM
1995
ACM
13 years 8 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
VLSID
1994
IEEE
13 years 9 months ago
1994
IEEE
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...