Abstract
Let G be a undirected connected graph. Given g groups each being a subset of V(G) and a number of colors, we consider how to find a subgroup of subsets such that there exists a tree interconnecting all vertices in each subset and all trees can be colored properly with given colors (no two trees sharing a common edge receive the same color); the objective is to maximize the number of subsets in the subgroup. This problem arises from the application of multicast communication in all optical networks. In this paper, we first obtain an explicit lower bound on the approximability of this problem and prove Ω(g 1−ε)-inapproximability even when G is a mesh. We then propose a simple greedy algorithm that achieves performance ratio O√|E(G)|, which matches the theoretical bounds.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bellare M, Goldreich O, Sudan M (1998) Free bits and nonapproximability–towards tight results, SIAM Journal on Computing 27:804–915
Chen X-J, Hu X-D, Jia X-H (2005) Complexity of minimal tree routing and coloring, Lecture Notes in Computer Science 3521:6–15
Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman and Company
Gu J, Hu X-D, Jia X-H, Zhang M-H (2004) Routing algorithm for multicast under multi-tree model in optical networks, Theoretical Computer Science 314:293–301
Gupta UI, Lee DT, Leung Y-T (1982) Efficient algorithms for interval graphs and circular-arc graphs, Networks 12:459–467
Hall P (1935) On representatives of subsets, Journal of the London Mathematical Society 10:26–30
Halldórsson MM (2000) Approximations of weighted independent set and hereditary subset problems, Journal of Graph Algorithms and Applications 4:1–16
Hastad J (1999) Clique is hard to approximate within \(n^1-\epsilon\), Acta Mathematica 182:105–142
Kleinberg J, Tardos E (1995) Disjoint paths in densely embedded graphs, in Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, Santa Fe, New Mexico, 52–61
Kollipoulos SG, Stein C (1998) Approximating disjoint-path problems using greedy algorithms and packing integer programs, Integer Programming and Combinatorial Optimization, Houston, TX
Kramer ME, van Leeuwen J The complexity of wire routing and finding the minimum area layouts for arbitrary VLSI circuits, in F.P. Preparata, editor, Advances in Computing Research; VLSI Theory 2:129–146, JAI Press Inc. Greenwich, CT-London
Nomikos C (2000) Routing and path coloring in rings: NP-completeness, Technical Report 15-2000, University of loannina, Greece
Nomikos C, Pagourtzis A, Zachos S (2003) Minimizing request blocking in all-optical rings, in Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA
Nomikos C, Zachos S (1997) Coloring a maximum number of paths in graphs, in Workshop on Algorithmic Aspects of Communication, Bologna
Robins G, Zelikovsky A (2000) Improved Steiner tree approximation in graphs, in Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, United States, pp. 770–779
Wan PJ, Liu L (1998) Maximal throughput in wavelength-routed optical networks, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 46:15–26
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported in part by the NSF of China under Grant No. 70221001 and 60373012.
Rights and permissions
About this article
Cite this article
Chen, X., Hu, X. & Shuai, T. Inapproximability and approximability of maximal tree routing and coloring. J Comb Optim 11, 219–229 (2006). https://doi.org/10.1007/s10878-006-7135-8
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10878-006-7135-8