| approximation to the minimum rooted star cover problem |
| Zhao Wenbo; Zhang Peng
|
| 2007
|
| 会议名称 | 4th International Conference on Theory and Applications of Models of Computation
|
| 会议录名称 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
|
| 页码 | 670-679
|
| 会议日期 | MAY 22-25,
|
| 会议地点 | Shanghai, PEOPLES R CHINA
|
| 收录类别 | ei,istp
|
| 出版地 | HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
|
| 出版者 | Theory and Applications of Models of Computation, Proceedings
|
| ISSN | 0302-9743
|
| ISBN | 978-3-540-72503-9
|
| 部门归属 | Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100080, Peoples R China.
|
| 摘要 | 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 |
| 关键词 | Minimum Rooted Star Cover
Approximation Algorithm
|
| 主办者 | Fudan Univ, Software Sch, Univ Leeds, Univ Wisconsin
|
| 语种 | 英语
|
| 内容类型 | 会议论文
|
| URI标识 | http://ir.iscas.ac.cn/handle/311060/11098
|
| 专题 | 中国科学院软件研究所
|
推荐引用方式
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.
|
修改评论