中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
A simple factor-3 approximation for labeling points with circles

文献类型:期刊论文

作者Jiang, MH; Qian, JB; Qin, ZP; Zhu, BH; Cimikowski, R
刊名INFORMATION PROCESSING LETTERS
出版日期2003-07-31
卷号87期号:2页码:101-105
关键词approximation algorithms circle packing map labeling NP-hardness
ISSN号0020-0190
DOI10.1016/S0020-0190(03)00256-4
英文摘要In this paper we present a simple factor-(3 + epsilon), 0 < epsilon < 1, approximation algorithm, which runs in O(n log n + n(1/epsilon)(O(1/epsilon2)) log(D-3/epsilonD(2))) time, for the problem of labeling a set P of n distinct points with uniform circles. (D-2 is the closest pair Of P and D-3 is the minimum diameter of all subsets of P with size three.) This problem is known to be NP-hard. Our bound improves the previous factor of 3.6 + epsilon. (C) 2003 Elsevier Science B.V. All rights reserved.
WOS研究方向Computer Science
语种英语
WOS记录号WOS:000183573100008
出版者ELSEVIER SCIENCE BV
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/18295]  
专题中国科学院数学与系统科学研究院
通讯作者Zhu, BH
作者单位1.Montana State Univ, Dept Comp Sci, Bozeman, MT 59717 USA
2.Chinese Acad Sci, Inst Appl Math, Beijing, Peoples R China
3.Huazhong Univ Sci & Technol, Dept Mat, Wuhan, Peoples R China
推荐引用方式
GB/T 7714
Jiang, MH,Qian, JB,Qin, ZP,et al. A simple factor-3 approximation for labeling points with circles[J]. INFORMATION PROCESSING LETTERS,2003,87(2):101-105.
APA Jiang, MH,Qian, JB,Qin, ZP,Zhu, BH,&Cimikowski, R.(2003).A simple factor-3 approximation for labeling points with circles.INFORMATION PROCESSING LETTERS,87(2),101-105.
MLA Jiang, MH,et al."A simple factor-3 approximation for labeling points with circles".INFORMATION PROCESSING LETTERS 87.2(2003):101-105.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。