Abstract
AbstractIn the 90’s Clark, Colbourn and Johnson wrote a seminal paper where they proved that maximum clique can be solved in polynomial time in unit disk graphs. Since then, the complexity of maximum clique in intersection graphs of d-dimensional (unit) balls has been investigated. For ball graphs, the problem is NP-hard, as shown by Bonamy et al. (FOCS ’18). They also gave an efficient polynomial time approximation scheme (EPTAS) for disk graphs. However, the complexity of maximum clique in this setting remains unknown. In this paper, we show the existence of a polynomial time algorithm for a geometric superclass of unit disk graphs. Moreover, we give partial results toward obtaining an EPTAS for intersection graphs of convex pseudo-disks.
Funder
Swiss National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference17 articles.
1. Aronov B, Donakonda, Anirudh EE, Pinchasi R (2018) On pseudo-disk hypergraphs. arXiv:1802.08799,
2. Bar-Noy A, Bar-Yehuda R, Freund A, Naor J, Schieber B (2001) A unified approach to approximating resource allocation and scheduling. J ACM (JACM) 48(5):1069–1090
3. Bonamy M, Bonnet É, Bousquet N, Charbit P, Thomassé S (2018) EPTAS for max clique on disks and unit balls. In: 2018 IEEE 59th annual symposium on foundations of computer science (FOCS). IEEE, pp 568–579
4. Bonnet É, Giannopoulos P, Kim EJ, Rzążewski P, Sikora F (2018) QPTAS and subexponential algorithm for maximum clique on disk graphs. In: 34th international symposiumon computational geometry (SoCG), pp. 12:1–12:15
5. Bonnet É, Grelier N, Miltzow T (2020) Maximum clique in disk-like intersection graphs. arXiv:2003.02583