QQ客服 官方微博 反馈留言

	Approximation and hardness results for the max k-uncut problem
	Zhang, Peng; Wu, Chenchen; Xu, Dachuan; Zhang, Xinghe
刊名	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
	2016
卷号	10043 LNCS页码:49-61
DOI	10.1007/978-3-319-48749-6_4
会议名称	10th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2016
URL标识	查看原文
会议日期	16 December 2016 through 18 December 2016
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/4704992
专题	山东大学
作者单位	1.School of Computer Science and Technology, Shandong University, Jinan 2.250101, China 3.Department of Information and Opera
推荐引用方式 GB/T 7714	Zhang, Peng,Wu, Chenchen,Xu, Dachuan,et al. Approximation and hardness results for the max k-uncut problem[J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),2016,10043 LNCS:49-61.
APA	Zhang, Peng,Wu, Chenchen,Xu, Dachuan,&Zhang, Xinghe.(2016).Approximation and hardness results for the max k-uncut problem.Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),10043 LNCS,49-61.
MLA	Zhang, Peng,et al."Approximation and hardness results for the max k-uncut problem".Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10043 LNCS(2016):49-61.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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