8 citations · 8 across the 3 of their papers we have counts for
3 papers
cs.CG2015
On the Minimum Cost Range Assignment Problem
Paz Carmi, Lilach Chaitman-Yerushalmi
We study the problem of assigning transmission ranges to radio stations placed arbitrarily in a -dimensional (-D) Euclidean space in order to achieve a strongly connected com…
cs.CG2012
Minimum Weight Euclidean t-spanner is NP-Hard
Paz Carmi, Lilach Chaitman-Yerushalmi
Given a set P of points in the plane, an Euclidean t-spanner for P is a geometric graph that preserves the Euclidean distances between every pair of points in P up to a constant fa…
cs.CG2010★ 8 cited
Bounded Degree Planar Geometric Spanners
Paz Carmi, Lilach Chaitman
Given a set of points in the plane, we show how to compute in time a subgraph of their Delaunay triangulation that has maximum degree 7 and is a strong planar…