Approximation schemes for geometric problems
Jan Remy · Repository for Publications and Research Data (ETH Zurich) · 2007
This thesis is clevoted to geometric optimization problems of the fol¬ lowing kind: given a set of points P C _f d1 we wish to compute a certain straight-linograph on P with minimum length, such as a short- est Steiner tree, a salesman tour or a triangulation.As most of these