Zvi Lotker

most citedThe minimal spanning tree and the upper box dimension

13 citations · 13 across the 2 of their papers we have counts for

collaborators

2 papers

cs.CG2005

Upper Bound on the Number of Vertices of Polyhedra with $0, 1$ -Constraint Matrices

Khaled Elbassioni, Zvi Lotker, Raimund Seidel

In this note we show that the maximum number of vertices in any polyhedron $P = {x \in R^{d} : A x \leq b}$ with $0, 1$ -constraint matrix $A$ and a real vector $b$ is at most $d…

math.CO2003★ 13 cited

The minimal spanning tree and the upper box dimension

Gady Kozma, Zvi Lotker, Gideon Stupp

We show that the alpha-weight of an MST over n points in a metric space with upper box dimension d has a bound independent of n if alpha is smaller than d and does not have one if…

Upper Bound on the Number of Vertices of Polyhedra with 0,1-Constraint Matrices

The minimal spanning tree and the upper box dimension

Upper Bound on the Number of Vertices of Polyhedra with $0, 1$ -Constraint Matrices