For n = 2 this holds because of the triangle inequality, but how to prove the general case?Let H be a metric space, then for n terminals there can be nor more than n-2 steiner points
Post here if you don't find any other place for your post. But please, stay on-topic: algorithms, programming or something related to this web site and its services.
Moderator: Board moderators
1 post • Page 1 of 1