DCG
2008
13 years 4 months ago
2008
In [GL] it was shown that a polytope with few vertices is far from being symmetric in the Banach-Mazur distance. More precisely, it was shown that Banach-Mazur distance between su...
DCG
2008
13 years 4 months ago
2008
We define a centrally symmetric analogue of the cyclic polytope and study its facial structure. We conjecture that our polytopes provide asymptotically the largest number of faces...
DCG
2010
13 years 4 months ago
2010
We express the matroid polytope PM of a matroid M as a signed Minkowski sum of simplices, and obtain a formula for the volume of PM . This gives a combinatorial expression for the...
DCG
2010
13 years 4 months ago
2010
: We investigate polyhedral 2k-manifolds as subcomplexes of the boundary complex of a regular polytope. We call such a subcomplex k-Hamiltonian if it contains the full k-skeleton o...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Suppose we are given a finite set of points P in R3 and a collection of polytopes T that are all translates of the same polytope T. We consider two problems in this paper. The firs...
IPCO
1992
13 years 5 months ago
1992
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...
CCCG
2003
13 years 5 months ago
2003
We give conditions under which the worst-case size of the silhouette of a polytope is sub-linear.
CONCUR
1993
Springer
13 years 8 months ago
1993
Springer
During the course of the last decade, a mathematical model for the parallelization of FOR-loops has become increasingly popular. In this model, a (perfect) nest of r FOR-loops is r...