Institutional Repository
| approximation to the minimum rooted star cover problem | |
| Zhao Wenbo; Zhang Peng | |
| 2007 | |
| Conference Name | 4th International Conference on Theory and Applications of Models of Computation |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 670-679 |
| Conference Date | MAY 22-25, |
| Conference Place | Shanghai, PEOPLES R CHINA |
| Indexed Type | ei,istp |
| Publish Place | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY |
| Publisher | Theory and Applications of Models of Computation, Proceedings |
| ISSN | 0302-9743 |
| ISBN | 978-3-540-72503-9 |
| Department | Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China. |
| English Abstract | In this paper, we study the following minimum rooted star cover problem: given a complete graph G = (V, E) with a length function l : E -> Z(+) that satisfies the triangle inequality, a designated root vertex r is an element of V, and a length |
| Keyword | Minimum Rooted Star Cover Approximation Algorithm |
| Sponsorship | Fudan Univ, Software Sch, Univ Leeds, Univ Wisconsin |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/11098 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Zhao Wenbo,Zhang Peng. approximation to the minimum rooted star cover problem[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:Theory and Applications of Models of Computation, Proceedings,2007:670-679. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| approximation to the（393KB） | 开放获取 | -- | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment