City Research Online

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs

Bonamy, M., Bonnet, É., Bousquet, N., Charbit, P., Giannopoulos, P. ORCID: 0000-0002-6261-1961, Kim, E. J., Rzazewski, P., Sikora, F. and Thomasse, S. (2021). EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. Journal of the ACM, 68(2), 9. doi: 10.1145/3433160

Abstract

A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for Maximum Cliqe on unit disk graphs [Clark, Colbourn, Johnson; Discrete Mathematics ’90]. Since then, it has been an intriguing open question whether or not tractability can be extended to general disk graphs. We show that the disjoint union of two odd cycles is never the complement of a disk graph nor of a unit (3-dimensional) ball graph. From that fact and existing results, we derive a simple QPTAS and a subexponential algorithm running in time 2O˜(n2/3) for Maximum Cliqe on disk and unit ball graphs. We then obtain a randomized EPTAS for computing the independence number on graphs having no disjoint union of two odd cycles as an induced subgraph, bounded VC-dimension, and linear independence number. This, in combination with our structural results, yields a randomized EPTAS for Max Cliqe on disk and unit ball graphs. Max Cliqe on unit ball graphs is equivalent to finding, given a collection of points in R3, a maximum subset of points with diameter at most some fixed value. In stark contrast, Maximum Cliqe on ball graphs and unit 4-dimensional ball graphs, as well as intersection graphs of filled ellipses (even close to unit disks) or filled triangles is unlikely to have such algorithms. Indeed, we show that, for all those problems, there is a constant ratio of approximation which cannot be attained even in time 2n1−ε, unless the Exponential Time Hypothesis fails.

Publication Type: Article
Additional Information: © 2020 The Authors | Association for Computing Machinery. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record is to be published in Journal of the ACM, https://doi.org/10.1145/3433160. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org.
Publisher Keywords: disk graph, maximum clique, computational complexity, approximation, algorithms, subexponential algorithms
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments: School of Mathematics, Computer Science & Engineering > Computer Science
School of Mathematics, Computer Science & Engineering > Computer Science > giCentre
Date available in CRO: 17 Dec 2020 15:32
Date deposited: 17 December 2020
Date of acceptance: 2 November 2020
Date of first online publication: 7 January 2021
URI: https://openaccess.city.ac.uk/id/eprint/25413
[img]
Preview
Text - Accepted Version
Download (978kB) | Preview

Export

Downloads

Downloads per month over past year

View more statistics

Actions (login required)

Admin Login Admin Login