Approximating Maximum Independent Set for Rectangles in the Plane

被引：11
|
作者：
Mitchell, Joseph S. B. [1 ]
机构：
[1] SUNY Stony Brook, Dept Appl Math & Stat, Stony Brook, NY 11794 USA
来源：
2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021) | 2022年
基金：
美国国家科学基金会;
关键词：
independent set; rectangles; approximation;
D O I：
10.1109/FOCS52979.2021.00042
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We give a polynomial-time constant-factor approximation algorithm for maximum independent set for (axisaligned) rectangles in the plane. Using a polynomial-time algorithm, the best approximation factor previously known is O(log log n). The results are based on a new form of recursive partitioning in the plane, in which faces that are constantcomplexity and orthogonally convex are recursively partitioned into a constant number of such faces.
引用
收藏
页码：339 / 350
页数：12
相关论文
共 50 条
  • [1] On Approximating Maximum Independent Set of Rectangles
    Chuzhoy, Julia
    Ene, Alina
    [J]. 2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2016, : 820 - 829
  • [2] Maximum Independent Set of Rectangles
    Chalermsook, Parinya
    Chuzhoy, Julia
    [J]. PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 892 - +
  • [3] Label placement by maximum independent set in rectangles
    Agarwal, PK
    van Kreveld, M
    Suri, S
    [J]. COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1998, 11 (3-4): : 209 - 218
  • [4] Approximation Schemes for Maximum Weight Independent Set of Rectangles
    Adamaszek, Anna
    Wiese, Andreas
    [J]. 2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, : 400 - 409
  • [5] A 3-Approximation Algorithm for Maximum Independent Set of Rectangles
    Galvez, Waldo
    Khan, Arindam
    Mari, Mathieu
    Momke, Tobias
    Pittu, Madhusudhan Reddy
    Wiese, Andreas
    [J]. PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 894 - 905
  • [6] AN OPTIMAL ALGORITHM FOR APPROXIMATING A SET OF RECTANGLES BY 2 MINIMUM AREA RECTANGLES
    BECKER, B
    FRANCIOSA, PG
    GSCHWIND, S
    OHLER, T
    THIEMT, G
    WIDMAYER, P
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 553 : 13 - 25
  • [7] The greedier the better: An efficient algorithm for approximating maximum independent set
    Lau, HY
    Ting, HF
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2001, 5 (04) : 411 - 420
  • [8] The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set
    H.Y. Lau
    H.F. Ting
    [J]. Journal of Combinatorial Optimization, 2001, 5 : 411 - 420
  • [9] Approximating minimum coloring and maximum independent set in dotted interval graphs
    Jiang, MH
    [J]. INFORMATION PROCESSING LETTERS, 2006, 98 (01) : 29 - 33
  • [10] Approximating the maximum independent set and minimum vertex coloring on box graphs
    Han, Xin
    Iwama, Kazuo
    Klein, Rolf
    Lingas, Andrzej
    [J]. ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2007, 4508 : 337 - +
12345