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 条
  • [1] Approximation algorithms for maximum independent set of a unit disk graph
    Das, Gautam K.
    De, Minati
    Kolay, Sudeshna
    Nandy, Subhas C.
    Sur-Kolay, Susmita
    INFORMATION PROCESSING LETTERS, 2015, 115 (03) : 439 - 446
  • [2] Improved Algorithm for Maximum Independent Set on Unit Disk Graph
    Jallu, Ramesh K.
    Das, Guatam K.
    ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2016, 2016, 9602 : 212 - 223
  • [3] Efficient independent set approximation in unit disk graphs
    Das, Gautam K.
    da Fonseca, Guilherme D.
    Jallu, Ramesh K.
    DISCRETE APPLIED MATHEMATICS, 2020, 280 : 63 - 70
  • [4] Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs
    Matsui, T
    DISCRETE AND COMPUTATIONAL GEOMETRY, 2000, 1763 : 194 - 200
  • [5] The Maximum Distance-d Independent Set Problem on Unit Disk Graphs
    Jena, Sangram K.
    Jallu, Ramesh K.
    Das, Gautam K.
    Nandy, Subhas C.
    FRONTIERS IN ALGORITHMICS (FAW 2018), 2018, 10823 : 68 - 80
  • [6] A new bound on maximum independent set and minimum connected dominating set in unit disk graphs
    Yingfan L. Du
    Hongmin W. Du
    Journal of Combinatorial Optimization, 2015, 30 : 1173 - 1179
  • [7] A new bound on maximum independent set and minimum connected dominating set in unit disk graphs
    Du, Yingfan L.
    Du, Hongmin W.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 30 (04) : 1173 - 1179
  • [8] MAXIMUM SIZE OF AN INDEPENDENT SET IN A GRAPH
    ALBERTSON, MO
    HUTCHINSON, JP
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1975, 22 (01): : A39 - A40
  • [9] Distributed Approximation of Maximum Independent Set and Maximum Matching
    Bar-Yehuda, Reuven
    Censor-Hillel, Keren
    Ghaffari, Mohsen
    Schwartzman, Gregory
    PROCEEDINGS OF THE ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'17), 2017, : 165 - 174
  • [10] A better constant-factor approximation for weighted dominating set in unit disk graph
    Huang, Yaochun
    Gao, Xiaofeng
    Zhang, Zhao
    Wu, Weili
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2009, 18 (02) : 179 - 194
12345