A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We study two problems that seek a subtree T of a graph G=(V,E) such that T satisfies a certain property and has minimal maximum degree. - In the Min-Degree Group Steiner Tree problem we are given a collection S of groups (subsets of V) and T should contain a node from every group. - In the Min-Degree Steiner k-Tree problem we are given a set R of terminals and an integer k, and T should contain at least k terminals. We show that if the former problem admits approximation ratio ρ then the laterarXiv:1910.12848v1 fatcat:wa4zb4jmqbcs7nsbk3gg3ll26y