4243 eng reportzib 0 2013-11-09 2013-11-09 -- We extend the primal-dual approximation technique of Goemans and Williamson to the Steiner connectivity problem, a kind of Steiner tree problem in hypergraphs. This yields a (k+1)-approximation algorithm for the case that k is the minimum of the maximal number of nodes in a hyperedge minus 1 and the maximal number of terminal nodes in a hyperedge. These results require the proof of a degree property for terminal nodes in hypergraphs which generalizes the well-known graph property that the average degree of terminal nodes in Steiner trees is at most 2. 1438-0064 urn:nbn:de:0297-zib-42430 Ralf Borndörfer Marika Karbstein Marika Karbstein 13-54 eng uncontrolled Primal-Dual Approximation eng uncontrolled Steiner Connectivity Problem eng uncontrolled Degree Property eng uncontrolled Hypergraph Connectivity Combinatorial optimization Approximation methods and heuristics Mathematical Optimization Mathematics of Transportation and Logistics Borndörfer, Ralf MATHEON-B15 Applied Optimization https://opus4.kobv.de/opus4-zib/files/4243/ZR-13-54.pdf https://opus4.kobv.de/opus4-zib/files/4243/ZR-13-54_revised.pdf