Zvi Lotker

activity

20032008

most citedThe minimal spanning tree and the upper box dimension

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

collaborators

Showing cs.CGShow all

2 papers · 1 filter

cs.CG2006

Power Assignment Problems in Wireless Communication

Stefan Funke, Soeren Laue, Zvi Lotker +1

A fundamental class of problems in wireless communication is concerned with the assignment of suitable transmission powers to wireless devices/stations such that the resulting comm…

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…

Power Assignment Problems in Wireless Communication

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

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