1 paper
Gabriel P. Braun, Marcia Fampa, Nelson Maculan +1
Given a set of terminals in Rd and an integer k≥0, the Euclidean bottleneck Steiner tree problem (EBSTP) asks for a tree spanning the terminals with at most k Ste…