A 2-Approximation Algorithm for Path Coloring on Trees of Rings

Authors:
Xiaotie Deng;Yi Zhou;Guojun Li;Wenan Zang
Affiliations:
-;-;-;-
Venue:
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Year:
2000

Citing 4
Cited 1

Fast approximation algorithms for multicommodity flow problems

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Efficient routing in all-optical networks

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Fast approximation algorithms for fractional packing and covering problems

Mathematics of Operations Research
Efficient routing in optical networks

Journal of the ACM (JACM)

On-line Algorithms for Edge-Disjoint Paths in Trees of Rings

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A tree of rings is an undirected graph obtained from a tree by replacing each node of the tree with a cycle and then contracting the edges of the tree so that two cycles corresponding to the two end-nodes of any edge have precisely one node in common. Given a set of paths on a tree of rings, the routing problem is to color the paths with the smallest number of colors so that any two paths sharing an edge are assigned different colors. We present a 2-approximation algorithm in this paper.