QQ客服 官方微博 反馈留言

	Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems
	Xu, Zi[1]; Du, Donglei[2]; Xu, Dachuan[3]
刊名	JOURNAL OF COMBINATORIAL OPTIMIZATION
	2014
卷号	27页码:315-327
关键词	Max-bisection problem 2-Catalog segmentation problem Approximation algorithm Semidefinite programming RPR2 rounding
ISSN号	1382-6905
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2276939
专题	上海大学
作者单位	1.[1]Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China. 2.[2]Univ New Brunswick, Fac Business Adm, Fredericton, NB E3B 5A3, Canada. 3.[3]Beijing Univ Technol, Dept Appl Math, Beijing 100124, Peoples R China.
推荐引用方式 GB/T 7714	Xu, Zi[1],Du, Donglei[2],Xu, Dachuan[3]. Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2014,27:315-327.
APA	Xu, Zi[1],Du, Donglei[2],&Xu, Dachuan[3].(2014).Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems.JOURNAL OF COMBINATORIAL OPTIMIZATION,27,315-327.
MLA	Xu, Zi[1],et al."Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems".JOURNAL OF COMBINATORIAL OPTIMIZATION 27(2014):315-327.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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