a new approximation algorithm for the k-facility location problem

ISCAS OpenIR

	a new approximation algorithm for the k-facility location problem
	Zhang Peng
	2006
会议名称	3rd International Conference on Theory and Applications of Models of Computation (TAMC 2006)
页码	217-230
会议日期	MAY 15-20,
会议地点	Beijing, PEOPLES R CHINA
收录类别	sci ; istp
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS
ISSN	0302-9743
ISBN	3-540-34021-1
部门归属	Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China. Grad Univ Chinese Acad Sci, Beijing, Peoples R China.
摘要	The k-facility location problem is a common generalization of the facility location and the k-median problems. For the metric uncapacitated k-facility location problem, we propose a polynomial-time 2 + congruent to root 3 + e-approximation alg
主办者	Chinese Acad Sci, Inst Software, Univ Leeds, Univ Wisconsin, Natl Nat Sci Fdn China
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/12190
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Zhang Peng. a new approximation algorithm for the k-facility location problem[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS,2006:217-230.