Mathematisch-Naturwissenschaftliche Fakultät: Suche
Anzeige der Dokumente 1-2 von 2
Geometric Dilation and Halving Distance
(2008)
Let us consider the network of streets of a city represented by a geometric graph G in the plane. The vertices of G represent the crossroads and the edges represent the streets. The latter do not have to be straight line ...
Approximation Complexity of Optimization Problems: Structural Foundations and Steiner Tree Problems
(2004)
In this thesis we study the approximation complexity of the Steiner Tree Problem and related problems as well as foundations in structural complexity theory. The Steiner Tree Problem is one of the most fundamental problems ...