QQ客服 官方微博 反馈留言

	Constant-competitive tree node assignment
	Zhang, Yong[1]; Chin, Francis Y. L.[2]; Ting, Hing-Fung[3]
刊名	THEORETICAL COMPUTER SCIENCE
	2014
卷号	518页码:10-21
关键词	Online algorithms Tree node assignment Competitive ratio
ISSN号	0304-3975
DOI	http://dx.doi.org/10.1016/j.tcs.2013.05.014
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/5079418
专题	河北大学
作者单位	1.[1]Hebei Univ, Coll Math & Comp Sci, Baoding, Hebei, Peoples R China. 2.Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China. 3.[2]Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China. 4.[3]Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China.
推荐引用方式 GB/T 7714	Zhang, Yong[1],Chin, Francis Y. L.[2],Ting, Hing-Fung[3]. Constant-competitive tree node assignment[J]. THEORETICAL COMPUTER SCIENCE,2014,518:10-21.
APA	Zhang, Yong[1],Chin, Francis Y. L.[2],&Ting, Hing-Fung[3].(2014).Constant-competitive tree node assignment.THEORETICAL COMPUTER SCIENCE,518,10-21.
MLA	Zhang, Yong[1],et al."Constant-competitive tree node assignment".THEORETICAL COMPUTER SCIENCE 518(2014):10-21.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。