Routing and coloring for maximal number of trees

CSpace > 应用数学研究所

	Routing and coloring for maximal number of trees
	Chen, XJ; Hu, XD; Shuai, TP
	2005
发表期刊	COMPUTING AND COMBINATORICS, PROCEEDINGS
ISSN	0302-9743
卷号	3595 页码:199-209
摘要	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 O(g(1-epsilon))-inapproximability even when G is a mesh. We then propose a simple greedy algorithm that achieves performance ratio O(root vertical bar E(G)vertical bar), which matches the theoretical bounds.
语种	英语
WOS研究方向	Computer Science
WOS类目	Computer Science, Theory & Methods
WOS记录号	WOS:000231866900022
出版者	SPRINGER-VERLAG BERLIN
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/1114
专题	应用数学研究所
通讯作者	Chen, XJ
作者单位	Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Chen, XJ,Hu, XD,Shuai, TP. Routing and coloring for maximal number of trees[J]. COMPUTING AND COMBINATORICS, PROCEEDINGS,2005,3595:199-209.
APA	Chen, XJ,Hu, XD,&Shuai, TP.(2005).Routing and coloring for maximal number of trees.COMPUTING AND COMBINATORICS, PROCEEDINGS,3595,199-209.
MLA	Chen, XJ,et al."Routing and coloring for maximal number of trees".COMPUTING AND COMBINATORICS, PROCEEDINGS 3595(2005):199-209.