# Approximating the clustered selected-internal Steiner tree problem

Given a complete graph G=(V,E), with nonnegative edge costs, two subsets R ⊂ V and R^'⊂ R, a partition ℛ={R_1,R_2,…,R_k} of R, R_i ∩ R_j=ϕ, i ≠ j and ℛ^'={R^'_1,R^'_2,…,R^'_k} of R^', R^'_i ⊂ R_i, a clustered Steiner tree is a tree T of G that spans all vertices in R such that T can be cut into k subtrees T_i by removing k-1 edges and each subtree T_i spanning all vertices in R_i, 1 ≤ i ≤ k. The cost of a clustered Steiner tree is defined to be the sum of the costs of all its edges. A clustered selected-internal Steiner tree of G is a clustered Steiner tree for R if all vertices in R^'_i are internal vertices of T_i, 1 ≤ i ≤ k. The clustered selected-internal Steiner tree problem is concerned with the determination of a clustered selected-internal Steiner tree T for R and R^' in G with minimum cost. In this paper, we present the first known approximation algorithm with performance ratio (ρ+4) for the clustered selected-internal Steiner tree problem, where ρ is the best-known performance ratio for the Steiner tree problem.

Comments

There are no comments yet.

## Authors

• 2 publications
11/20/2019

### A 2-approximation for the k-prize-collecting Steiner tree problem

We consider the k-prize-collecting Steiner tree problem. An instance is ...
12/04/2021

### Algorithms for Maximum Internal Spanning Tree Problem for Some Graph Classes

For a given graph G, a maximum internal spanning tree of G is a spanning...
08/02/2020

### On extremal leaf status and internal status of trees

For a vertex u of a tree T, the leaf (internal, respectively) status of ...
12/19/2019

### Imposing edges in Minimum Spanning Tree

We are interested in the consequences of imposing edges in T a minimum s...
06/22/2020

### Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs

Given a connected vertex-weighted graph G, the maximum weight internal s...
05/21/2018

### A 5/2-Approximation Algorithm for Coloring Rooted Subtrees of a Degree 3 Tree

A rooted tree R⃗ is a rooted subtree of a tree T if the tree obtained by...
07/30/2020

### Synchronized Planarity with Applications to Constrained Planarity Problems

We introduce the problem Synchronized Planarity. Roughly speaking, its i...
##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.