| Title: | a new approximation algorithm for the k-facility location problem |
| Author: | Zhang Peng
|
| Conference Name: | 3rd International Conference on Theory and Applications of Models of Computation (TAMC 2006)
|
| Conference Date: | MAY 15-20,
|
| Issued Date: | 2006
|
| Conference Place: | Beijing, PEOPLES R CHINA
|
| Publisher: | THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS
|
| Publish Place: | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
|
| Indexed Type: | sci
; istp
|
| ISSN: | 0302-9743
|
| ISBN: | 3-540-34021-1
|
| Department: | Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China. Grad Univ Chinese Acad Sci, Beijing, Peoples R China.
|
| Sponsorship: | Chinese Acad Sci, Inst Software, Univ Leeds, Univ Wisconsin, Natl Nat Sci Fdn China
|
| English Abstract: | 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 |
| Language: | 英语
|
| Content Type: | 会议论文
|
| URI: | http://ir.iscas.ac.cn/handle/311060/12190
|
| Appears in Collections: | 软件所图书馆_会议论文
|
| File Name/ File Size |
Content Type |
Version |
Access |
License |
|
|---|
| a new approximation algorithm for the k-facility location problem.pdf（501KB） | -- | -- | 限制开放 | -- | 联系获取全文 |
|
| Recommended Citation: | |
Zhang Peng. a new approximation algorithm for the k-facility location problem[C]. 见:3rd International Conference on Theory and Applications of Models of Computation (TAMC 2006). Beijing, PEOPLES R CHINA. MAY 15-20,.
|
|
|
