DeepAI AI Chat
Log In Sign Up

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

by   Anuj Rawat, et al.

A rooted tree R⃗ is a rooted subtree of a tree T if the tree obtained by replacing the directed edges of R⃗ by undirected edges is a subtree of T. We study the problem of assigning minimum number of colors to a given set of rooted subtrees R of a given tree T such that if any two rooted subtrees share a directed edge, then they are assigned different colors. The problem is NP hard even in the case when the degree of T is restricted to 3. We present a 5/2-approximation algorithm for this problem. The motivation for studying this problem stems from the problem of assigning wavelengths to multicast traffic requests in all-optical WDM tree networks.


page 1

page 2

page 3

page 4


PTAS and Exact Algorithms for r-Gathering Problems on Tree

r-gathering problem is a variant of facility location problems. In this ...

On the minimum spanning tree problem in imprecise set-up

In this article, we study the Euclidean minimum spanning tree problem in...

Coloring and Recognizing Directed Interval Graphs

A mixed interval graph is an interval graph that has, for every pair of ...

Geometric Multicut

We study the following separation problem: Given a collection of colored...

Parameterized Algorithms for Colored Clustering

In the Colored Clustering problem, one is asked to cluster edge-colored ...

Rooting for phylogenetic networks

This paper studies the relationship between undirected (unrooted) and di...

Your Rugby Mates Don't Need to Know your Colleagues: Triadic Closure with Edge Colors

Given an undirected graph G=(V,E) the NP-hard Strong Triadic Closure (ST...