8 citations · 24 across the 27 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CG2013
Approximating the Bottleneck Plane Perfect Matching of a Point Set
A. Karim Abu-Affash, Ahmad Biniaz, Paz Carmi +2
A bottleneck plane perfect matching of a set of points in is defined to be a perfect non-crossing matching that minimizes the length of the longest edge; the len…
cs.CG2013
An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem
Ahmad Biniaz, Anil Maheshwari, Michiel Smid
Let and be two disjoint sets of and points in the plane, respectively. We consider the problem of computing a Steiner tree whose Steiner vertices belong to , in…