Access the full text.
Sign up today, get DeepDyve free for 14 days.
(2015)
Maximum clique for disks of two sizes. Open problems fromGeometric Intersection Graphs: Problems and Directions CG Week Workshop
T. Nieberg, J. Hurink (2005)
A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs
A. Fishkin (2003)
Disk Graphs: A Short Survey
Timothy Chan (2003)
Polynomial-time approximation schemes for packing and piercing fat objectsJ. Algorithms, 46
Sergio Cabello, J. Cardinal, S. Langerman (2011)
The Clique Problem in Ray Intersection GraphsDiscrete & Computational Geometry, 50
Warren Smith, N. Wormald (1998)
Geometric Separator Theorems & Applications
Sariel Har-Peled, Haim Kaplan, Wolfgang Mulzer, L. Roditty, Paul Seiferth, M. Sharir, Max Willert (2018)
Stabbing pairwise intersecting disks by five points
Ross J. Kang, Tobias Müller (2012)
Sphere and dot product representations of graphsDisc. Comput. Geom., 47
P. Afshani, Hamed Hatami (2006)
Approximation and inapproximability results for maximum clique of disc graphs in high dimensionsInf. Process. Lett., 105
Z. Füredi (1987)
The number of maximal independent sets in connected graphsJ. Graph Theory, 11
A. Brandstädt, V. Le, J. Spinrad (1987)
Graph Classes: A Survey
V. Brimkov, Konstanty Junosza-Szaniawski, Sean Kafer, Jan KratochvÃl, M. Pergel, PaweÅ‚ Rzaͅżewski, Matthew Szczepankiewicz, Joshua Terhaar (2018)
Homothetic polygons and beyond: Maximal cliques in intersection graphsDiscret. Appl. Math., 247
(1986)
Zur lösung des Gallaischen problems über Kreisscheiben in der Euklidischen Ebene. Studia Sci
T. Erlebach, K. Jansen, Eike Seidel (2005)
Polynomial-Time Approximation Schemes for Geometric Intersection GraphsSIAM J. Comput., 34
M. Middendorf, F. Pfeiffer (1992)
The max clique problem in classes of string-graphsDiscret. Math., 108
Marthe Bonamy, Édouard Bonnet, N. Bousquet, Pierre Charbit, Stéphan Thomassé (2018)
EPTAS for Max Clique on Disks and Unit Balls2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
V. Raghavan, J. Spinrad (2001)
Robust algorithms for restricted domains
(2015)
Paschos
Van Leeuwen, J. E., Link (2009)
UvA-DARE ( Digital Academic Repository ) Optimization and approximation on systems of geometric objects
(1989)
Warmuth
T. McKee, F. McMorris (1987)
Topics in Intersection Graph Theory
Timothy M. Chan, Sariel Har-Peled (2012)
Approximation algorithms for maximum independent set of pseudo-disksDisc. Comput. Geom., 48
N. Alon, R. Yuster, Uri Zwick (1997)
Finding and counting given length cyclesAlgorithmica, 17
E. Györi, A. Kostochka, T. Luczak (1997)
Graphs without short odd cycles are nearly bipartiteDiscret. Math., 163
L. Danzer (1986)
Zur lösung des Gallaischen problems über Kreisscheiben in der Euklidischen EbeneStudia Sci. Math. Hungar, 21
Paz Carmi, M. Katz, Pat Morin (2018)
Stabbing Pairwise Intersecting Disks by Four PointsDiscrete & Computational Geometry, 70
P. Agarwal, Nabil Mustafa (2004)
Independent set of intersection graphs of convex objects in 2DComput. Geom., 34
Jan KratochvÃl, J. MatouÅ¡ek (1994)
Intersection Graphs of SegmentsJ. Comb. Theory, Ser. B, 62
Ross Kang, Tobias Müller (2011)
Sphere and Dot Product Representations of GraphsDiscrete & Computational Geometry, 47
Brent Clark, C. Colbourn, David Johnson (1991)
Unit disk graphsDiscret. Math., 86
R. Impagliazzo, R. Paturi, F. Zane (1998)
Which problems have strongly exponential complexity?Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
(1877)
Some elementary properties of closed plane curves
S. Artmann, R. Weismantel, R. Zenklusen (2017)
A strongly polynomial algorithm for bimodular integer linear programmingProceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing
D. Marx, Michal Pilipczuk (2015)
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi DiagramsACM Transactions on Algorithms (TALG), 18
J. Alber, J. Fiala (2002)
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
Christoph Ambühl, Uli Wagner (2005)
The Clique Problem in Intersection Graphs of Ellipses and TrianglesTheory of Computing Systems, 38
A. Atminas, V. Zamaraev (2016)
On Forbidden Induced Subgraphs for Unit Disk GraphsDiscrete & Computational Geometry, 60
Ran Duan, Seth Pettie (2014)
Linear-Time Approximation for Maximum Weight MatchingJ. ACM, 61
Ewa Malesinska, S. Piskorz, Gerhard Weißenfels (1998)
On the chromatic number of disk graphsNetworks, 32
B. Aronov, Anirudh Donakonda, Esther Ezra, R. Pinchasi (2018)
On Pseudo-disk HypergraphsArXiv, abs/1802.08799
J. Il (1994)
Precoloring Extension with Fixed Color Bound
Chaya Keller, Shakhar Smorodinsky, G. Tardos (2017)
On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers
Russell Impagliazzo, Ramamohan Paturi, Francis Zane (2001)
Which problems have strongly exponential complexity? JComput. Syst. Sci., 63
Timothy Chan, Sariel Har-Peled (2009)
Approximation Algorithms for Maximum Independent Set of Pseudo-DisksDiscrete & Computational Geometry, 48
P. Afshani, Timothy Chan (2005)
Approximation Algorithms for Maximum Cliques in 3D Unit-Disk Graphs
Université Paris-Dauphine, PSL University, CNRS UMR, LAMSADE, Paris, France
A nice class, which appears to be a subclass of unit ball graphs, is that of the so-called Borsuk graphs: We are given some (small)
Vladimir N. Vapnik, A. Ya Chervonenkis (2015)
On the uniform convergence of relative frequencies of events to their probabilitiesMeas. Complex. Springer
H. Breu, D. Kirkpatrick (1998)
Unit disk graph recognition is NP-hardComput. Geom., 9
Sergio Cabello (2015)
Maximum clique for disks of two sizesOpen problems fromGeometric Intersection Graphs: Problems and Directions CG Week Workshop. Retrieved from http://cgweek15.tcs.uj.edu.pl/problems.pdf.
Erik Jan van Leeuwen (2009)
Optimization and Approximation on Systems of Geometric ObjectsPh.D. Dissertation. Utrecht University.
E. Leeuwen (2006)
Better Approximation Schemes for Disk Graphs
(1981)
A solution of Gallai’s problem on pinning down circles
Sergio Cabello (2015)
Open problems presented at theAlgorithmic Graph Theory on the Adriatic Coast WorkshopRetrieved from https://conferences.matheo.si/event/6/picture/35.pdf.
Paul Koebe (1936)
Kontaktprobleme der konformen AbbildungBerichte über die Verhandlungen der Sächsischen Akademie der Wissenschaften zu Leipzig, 88
D. Haussler, E. Welzl (1986)
Epsilon-nets and simplex range queries
C. Biró, Édouard Bonnet, D. Marx, Tillmann Miltzow, Paweł Rzaͅżewski (2017)
Fine-Grained Complexity of Coloring Unit Disks and BallsJ. Comput. Geom., 9
Herbert Grundmann, Vom Ursprung, Im Mittelalter (1953)
BERICHTE ÜBER DIE VERHANDLUNGEN DER SÄCHSISCHEN AKADEMIE DER WISSENSCHAFTEN ZU LEIPZIGNikolaus von Cues in seinen Beziehungen zur bildenden Kunst
Stéphan Ceroi (2002)
The clique number of unit quasi-disk graphs
T. Nieberg, J. Hurink, W. Kern (2004)
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
Dana Moshkovitz, R. Raz (2008)
Two Query PCP with Sub-Constant Error2008 49th Annual IEEE Symposium on Foundations of Computer Science
M. ChlebÃk, J. ChlebÃková (2006)
Complexity of approximating bounded variants of optimization problemsTheor. Comput. Sci., 354
V. Vapnik (1971)
Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities
J. Bang-Jensen, Bruce Reed, M. Schacht, Robert Šámal, B. Toft, Uli Wagner (2006)
On Six Problems Posed by Jarik Nešetřil
Édouard Bonnet, P. Giannopoulos, Eun Kim, Paweł Rzaͅżewski, F. Sikora (2017)
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs
Adrian Bock, Yuri Faenza, Carsten Moldenhauer, Andres Ruiz-Vargas (2014)
Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number
Jan KratochvÃl (1996)
Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane
(2015)
Open problems presented at the Algorithmic Graph Theory on the Adriatic Coast workshop, Koper, Slovenia (https://conferences.matheo.si/event/6/picture/35.pdf)
J. Pach, P. Agarwal, M. Sharir (2008)
State of the Union (of geometric objects)
A. Blumer, A. Ehrenfeucht, D. Haussler, Manfred Warmuth (1989)
Learnability and the Vapnik-Chervonenkis dimensionJ. ACM, 36
Matt Gibson, I. Pirwani (2010)
Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier - (Extended Abstract)
K. Kawarabayashi, B. Reed (2010)
Odd cycle packing
Zdenek Dvorák, J. Pekárek (2020)
Induced odd cycle packing number, independent sets, and chromatic numberJournal of Graph Theory, 103
Édouard Bonnet, B. Escoffier, Eun Kim, V. Paschos (2013)
On Subexponential and FPT-Time InapproximabilityAlgorithmica, 71
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 CLIQUE 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 2Õ(n2/3) for MAXIMUM CLIQUE 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 CLIQUE on disk and unit ball graphs. MAX CLIQUE 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 CLIQUE 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 that cannot be attained even in time 2n1−ɛ, unless the Exponential Time Hypothesis fails.
Journal of the ACM (JACM) – Association for Computing Machinery
Published: Jan 6, 2021
Keywords: Disk graph
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.