Faster approximation for maximum independent set on unit disk graph

被引：6
|
作者：
Nandy, Subhas C. [1 ]
Pandit, Supantha [1 ]
Roy, Sasanka [1 ]
机构：
[1] Indian Stat Inst, Kolkata, India
来源：
INFORMATION PROCESSING LETTERS | 2017年 / 127卷
关键词：
Approximation algorithms; Computational geometry; Maximum independent set; Unit disk graph; Dynamic programming;
D O I：
10.1016/j.ipl.2017.07.007
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Maximum independent set from a given set D of unit disks intersecting a horizontal line can be solved in O (n(2)) time and O (n(2)) space. As a corollary, we design a factor 2 approximation algorithm for the maximum independent set problem on unit disk graph which takes both time and space of O (n(2)). The best known factor 2 approximation algorithm for this problem runs in O (n(2) logn) time and takes O (n(2)) space [1,2]. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码：58 / 61
页数：4
相关论文
共 50 条
12345