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 条
  • [21] MAXIMUM INDEPENDENT SET OF A PERMUTATION GRAPH IN K TRACKS
    Lee, D. T.
    Sarrafzadeh, Majid
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1993, 3 (03) : 291 - 304
  • [22] Finding a maximum independent set in a sparse random graph
    Feige, U
    Ofek, E
    APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2005, 3624 : 282 - 293
  • [23] Hardness of the maximum-independent-set problem on unit-disk graphs and prospects for quantum speedups
    Andrist, Ruben S.
    Schuetz, Martin J. A.
    Minssen, Pierre
    Yalovetzky, Romina
    Chakrabarti, Shouvanik
    Herman, Dylan
    Kumar, Niraj
    Salton, Grant
    Shaydulin, Ruslan
    Sun, Yue
    Pistoia, Marco
    Katzgraber, Helmut G.
    PHYSICAL REVIEW RESEARCH, 2023, 5 (04):
  • [24] A NOTE ON MAXIMUM INDEPENDENT SETS AND MINIMUM CLIQUE PARTITIONS IN UNIT DISK GRAPHS AND PENNY GRAPHS: COMPLEXITY AND APPROXIMATION
    Cerioli, Marcia R.
    Faria, Luerbio
    Ferreira, Talita O.
    Protti, Fabio
    RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2011, 45 (03): : 331 - 346
  • [25] Maximum genus and maximum nonseparating independent set of a 3-regular graph
    Huang, YQ
    Liu, YP
    DISCRETE MATHEMATICS, 1997, 176 (1-3) : 149 - 158
  • [26] A polynomial-time OPTe-approximation algorithm for maximum independent set of connected subgraphs in a planar graph
    Cslovjecsek, Jana
    Pilipczuk, Michal
    Wegrzycki, Karol
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 625 - 638
  • [27] Approximation Algorithms for Maximum Independent Set of Pseudo-Disks
    Chan, Timothy M.
    Har-Peled, Sariel
    PROCEEDINGS OF THE TWENTY-FIFTH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SCG'09), 2009, : 333 - 340
  • [28] AN APPROXIMATION ALGORITHM FOR THE MAXIMUM INDEPENDENT SET PROBLEM ON PLANAR GRAPHS
    CHIBA, N
    NISHIZEKI, T
    SAITO, N
    SIAM JOURNAL ON COMPUTING, 1982, 11 (04) : 663 - 675
  • [29] Approximation Algorithms for Maximum Independent Set of Pseudo-Disks
    Chan, Timothy M.
    Har-Peled, Sariel
    DISCRETE & COMPUTATIONAL GEOMETRY, 2012, 48 (02) : 373 - 392
  • [30] A 3-Approximation Algorithm for Maximum Independent Set of Rectangles
    Galvez, Waldo
    Khan, Arindam
    Mari, Mathieu
    Momke, Tobias
    Pittu, Madhusudhan Reddy
    Wiese, Andreas
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 894 - 905
12345