DeepAI AI Chat
Log In Sign Up

Bounded Degree Group Steiner Tree Problems

by   Guy Kortsarz, et al.

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 later problem admits approximation ratio ρ· O(log k). For bounded treewidth graphs, we obtain approximation ratio O(log^3 n) for Min-Degree Group Steiner Tree. In the more general Bounded Degree Group Steiner Tree problem we are also given edge costs and degree bounds {b(v):v ∈ V}, and T should obey the degree constraints deg_T(v) ≤ b(v) for all v ∈ V. We give a bicriteria (O(log N log | S|),O(log^2 n))-approximation algorithm for this problem on tree inputs, where N is the size of the largest group, generalizing the approximation of Garg, Konjevod, and Ravi for the case without degree bounds.


page 1

page 2

page 3

page 4


2-node-connectivity network design

We consider network design problems in which we are given a graph G=(V,E...

Approximation algorithms for connectivity augmentation problems

In Connectivity Augmentation problems we are given a graph H=(V,E_H) and...

Dimension of CPT posets

A containment model M_P of a poset P=(X,≼) maps every x ∈ X to a set M_x...

The Maximum Binary Tree Problem

We introduce and investigate the approximability of the maximum binary t...

Degrees and Network Design: New Problems and Approximations

While much of network design focuses mostly on cost (number or weight of...

Approximating the Log-Partition Function

Variational approximation, such as mean-field (MF) and tree-reweighted (...

Hardness and approximation of the Probabilistic p-Center problem under Pressure

The Probabilistic p-Center problem under Pressure (Min PpCP) is a varian...