Approximating Maximum Independent Set for Rectangles in the Plane

IF 1.2 3区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

SIAM Journal on Computing Pub Date : 2024-07-23 DOI:10.1137/22m1475521

Joseph Mitchell

引用次数: 0

Abstract

SIAM Journal on Computing, Ahead of Print.
Abstract. We give a polynomial-time constant-factor approximation algorithm for the maximum independent set of (axis-aligned) rectangles problem in the plane. Using a polynomial-time algorithm, the best approximation factor previously known is [math]. The results are based on a new form of recursive partitioning in the plane, in which faces that are constant-complexity and orthogonally convex are recursively partitioned into a constant number of such faces.

查看原文本刊更多论文

近似平面内矩形的最大独立集

SIAM 计算期刊》，提前印刷。摘要我们给出了平面内矩形（轴对齐）最大独立集问题的多项式时间恒因子近似算法。使用多项式时间算法，之前已知的最佳近似因子是 [math]。这些结果基于一种新的平面递归分割形式，即把复杂度恒定且正交凸的面递归分割成恒定数量的此类面。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

SIAM Journal on Computing 工程技术-计算机：理论方法

CiteScore

4.60

自引率

0.00%

发文量

审稿时长

6-12 weeks

期刊介绍： The SIAM Journal on Computing aims to provide coverage of the most significant work going on in the mathematical and formal aspects of computer science and nonnumerical computing. Submissions must be clearly written and make a significant technical contribution. Topics include but are not limited to analysis and design of algorithms, algorithmic game theory, data structures, computational complexity, computational algebra, computational aspects of combinatorics and graph theory, computational biology, computational geometry, computational robotics, the mathematical aspects of programming languages, artificial intelligence, computational learning, databases, information retrieval, cryptography, networks, distributed computing, parallel algorithms, and computer architecture.