Institutional Repository
| a new approximation algorithm for the k-facility location problem | |
| Zhang Peng | |
| 2006 | |
| Conference Name | 3rd International Conference on Theory and Applications of Models of Computation (TAMC 2006) |
| Pages | 217-230 |
| Conference Date | MAY 15-20, |
| Conference Place | Beijing, PEOPLES R CHINA |
| Indexed Type | sci ; istp |
| Publish Place | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| Publisher | THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS |
| 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. |
| 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 |
| Sponsorship | Chinese Acad Sci, Inst Software, Univ Leeds, Univ Wisconsin, Natl Nat Sci Fdn China |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/12190 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation 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. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| a new approximation （501KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment