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({\sqrt{|E(G)|}})\), which matches the theoretical bounds.
Supported in part by the NSF of China under Grant No. 70221001 and 60373012.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bellare, M., Goldreich, O., Sudan, M.: Free bits and nonapproximability–towards tight results. SIAM J. Comput. 27, 804–915 (1998)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, New York (1979)
Gu, J., Hu, X.-D., Jia, X.-H., Zhang, M.-H.: Routing algorithm for multicast under multi-tree model in optical networks. Theoretical Computer Science 314, 293–301 (2004)
Gupta, U.I., Lee, D.T., Leung, Y.-T.: Efficient algorithms for interval graphs and circular-arc graphs. Networks 12, 459–467 (1982)
Hall, P.: On representatives of subsets. J. London Math. Soc. 10, 26–30 (1935)
Halldórsson, M.M.: Approximations of weighted independent set and hereditary subset problems. J. Graph Algorithms and Applications 4(1), 1–16 (2000)
Hastad, J.: Clique is hard to approximate within n1−ε. Acta Mathematica 182, 105–142 (1999)
Kleinberg, J., Tardos, E.: Disjoint paths in densely embedded graphs. In: Proc. 36th Annual ACM Symp. Theory of Computing, pp. 52–61 (1995)
Kollipoulos, S.G., Stein, C.: Approximating disjoint-path problems using greedy algorithms and packing integer programs. In: Integer Programming and Combinatorial Optimization, Houston, TX (1998)
Kou, L., Markowsky, G., Berman, L.: A fast algorithm for steiner trees. Acta Informatica 15, 141–145 (1981)
Nomikos, C., Pagourtzis, A., Zachos, S.: Minimizing request blocking in alloptical rings. In: IEEE INFOCOM 2003 (2003)
Nomikos, C., Zachos, S.: Coloring a maximum number of paths in graphs, Workshop on Algorithmic Aspects of Communication, Bologna (1997)
Wan, P.J., Liu, L.: Maximal throughput in wavelength-routed optical networks. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 46, 15–26 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, X., Hu, X., Shuai, T. (2005). Routing and Coloring for Maximal Number of Trees. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_22
Download citation
DOI: https://doi.org/10.1007/11533719_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28061-3
Online ISBN: 978-3-540-31806-4
eBook Packages: Computer ScienceComputer Science (R0)