Hauptmann, Mathias: Approximation Complexity of Optimization Problems : Structural Foundations and Steiner Tree Problems. - Bonn, 2004. - Dissertation, Rheinische Friedrich-Wilhelms-Universität Bonn.
Online-Ausgabe in bonndoc: https://nbn-resolving.org/urn:nbn:de:hbz:5N-03801
urn: https://nbn-resolving.org/urn:nbn:de:hbz:5N-03801,
author = {{Mathias Hauptmann}},
title = {Approximation Complexity of Optimization Problems : Structural Foundations and Steiner Tree Problems},
school = {Rheinische Friedrich-Wilhelms-Universität Bonn},
year = 2004,
note = {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 in combinatorial optimization. It asks for a shortest connection of a given set of points in an edge-weighted graph. This problem and its numerous variants have applications ranging from electrical engineering, VLSI design and transportation networks to internet routing. It is closely connected to the famous Traveling Salesman Problem and serves as a benchmark problem for approximation algorithms.
We give a survey on the Steiner tree Problem, obtaining lower bounds for approximability of the (1,2)-Steiner Tree Problem by combining hardness results of Berman and Karpinski with reduction methods of Bern and Plassmann. We present approximation algorithms for the Steiner Forest Problem in graphs and bounded hypergraphs, the Prize Collecting Steiner Tree Problem and related problems where prizes are given for pairs of terminals. These results are based on the Primal-Dual method and the Local Ratio framework of Bar-Yehuda. We study the Steiner Network Problem and obtain combinatorial approximation algorithms with reasonable running time for two special cases, namely the Uniform Uncapacitated Case and the Prize Collecting Uniform Uncapacitated Case. For the general case, Jain's algorithms obtains an approximation ratio of 2, based on the Ellipsoid Method. We obtain polynomial time approximation schemes for the Dense Prize Collecting Steiner Tree Problem, Dense k-Steiner Problem and the Dense Class Steiner Tree Problem based on the methods of Karpinski and Zelikovsky for approximating the Dense Steiner Tree Problem.
Motivated by the question which parameters make the Steiner Tree problem hard to solve, we make an excurs into Fixed Parameter Complexity, focussing on structural aspects of the W-Hierarchy. We prove a Speedup Theorem for the classes FPT and SP and versions if Levin's Lower Bound Theorem for the class SP as well as for Randomized Space Complexity.
Starting from the approximation schemes for the dense Steiner Tree problems, we deal with the efficiency of polynomial time approximation schemes in general. We separate the class EPTAS from PTAS under some reasonable complexity theoretic assumption. The same separation was achieved by Cesaty and Trevisan under some assumtion from Fixed Parameter Complexity. We construct an oracle under which our assumtion holds but that of Cesati and Trevisan does not, which implies that using relativizing proof techniques one cannot show that our assumption implies theirs.},

url = {https://hdl.handle.net/20.500.11811/2050}

Die folgenden Nutzungsbestimmungen sind mit dieser Ressource verbunden: