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 条

[41] An nO(1/ε) Approximation Scheme for the Minimum Dominating Set in Unit Disk Graphs
Fakcharoephol, Jittat
Sukprasert, Pattara
2018 15TH INTERNATIONAL JOINT CONFERENCE ON COMPUTER SCIENCE AND SOFTWARE ENGINEERING (JCSSE), 2018, : 81 - 85
[42] Approximation Algorithms for the Connected Dominating Set Problem in Unit Disk Graphs
Gang Lu
Journal of Electronic Science and Technology, 2009, 7 (03) : 214 - 222
[43] Parallel Algorithm for Minimum Partial Dominating Set in Unit Disk Graph
Hong, Weizhi
Zhang, Zhao
Ran, Yingli
COMBINATORIAL OPTIMIZATION AND APPLICATIONS, COCOA 2021, 2021, 13135 : 527 - 537
[44] A robust PTAS for maximum weight independent sets in unit disk graphs
Nieberg, T
Hurink, J
Kern, W
GRAPH -THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2004, 3353 : 214 - 221
[45] Maximum Independent Set Approximation Based on Bellman-Ford Algorithm
Dahshan, Mostafa H.
ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2014, 39 (10) : 7003 - 7011
[46] AN APPROXIMATION ALGORITHM FOR THE MAXIMUM INDEPENDENT SET PROBLEM IN CUBIC PLANAR GRAPHS
CHOUKHMANE, E
FRANCO, J
NETWORKS, 1986, 16 (04) : 349 - 356
[47] GENETIC ALGORITHMIC APPROACH TO FIND THE MAXIMUM WEIGHT INDEPENDENT SET OF A GRAPH
Abu Nayeem, Sk. Md.
Pal, Madhumangal
JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2007, 25 (1-2) : 217 - 229
[48] AN EFFICIENT ALGORITHM FOR FINDING A MAXIMUM WEIGHT INDEPENDENT SET OF A CIRCLE GRAPH
GOLDSCHMIDT, O
TAKVORIAN, A
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1994, E77A (10) : 1672 - 1674
[49] Fast And Simple Approximation Algorithms for Maximum Weighted Independent Set of Links
Wan, Peng-Jun
Jia, Xiaohua
Dai, Guojun
Du, Hongwei
Frieder, Ophir
2014 PROCEEDINGS IEEE INFOCOM, 2014, : 1653 - 1661
[50] Maximum Independent Set Approximation Based on Bellman-Ford Algorithm
Mostafa H. Dahshan
Arabian Journal for Science and Engineering, 2014, 39 : 7003 - 7011

← 1 2 3 4 5 →