DOCSLIB.ORG

Approximation Algorithms for Unit Disk Graphs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Approximation Algorithms for Unit Disk Graphs Approximation Algorithms for Unit Disk Graphs Erik Jan van Leeuwen institute of information and computing sciences, utrecht university technical report UU-CS-2004-066 www.cs.uu.nl Approximation Algorithms for Unit Disk Graphs∗ Erik Jan van Leeuwen Institute for Information and Computing Sciences, Utrecht University, Padualaan 14, 3584 CH Utrecht, the Netherlands. E-mail: [email protected] Abstract Mobile ad hoc networks are frequently modeled by unit disk graphs. We consider several classical graph theoretic problems on unit disk graphs (Maximum Independent Set, Minimum Vertex Cover, and Minimum (Connected) Dominating Set), which are relevant to such networks. We propose two new notions for unit disk graphs: thickness and density. The thickness of a graph is the number of disk centers in any width 1 slab. If the thickness of a graph is bounded, then the considered problems can be solved in polynomial time. We prove this both indirectly by presenting a relation between unit disk graphs of bounded thickness and the pathwidth of such graphs, and directly by giving dynamic programming algorithms. This result implies that the problems are fixed-parameter tractable in the thickness. We then consider unit disk graphs of bounded density. The density of a graph is the number of disk centers in any 1-by-1 box. We present a new approximation scheme for the considered problems, which uses the bounded thickness results mentioned above and the so called shifting technique. We show that the scheme is an asymptotic FPTAS and that this result is optimal, in the sense that no FPTAS can exist (unless P=NP). The scheme for Minimum Connected Dominating Set is the first FPTAS∞ for this problem. The analysis that is applied can also be used to improve existing results, which among others implies the existence of an FPTAS∞ for MCDS on planar graphs. 1 Introduction Mobile ad hoc networks are the next generation in communication networks. Devices can enter or leave the network anytime, devices can be mobile, and no centralized control points or base stations are necessary. This flexibility makes mobile ad hoc networks very interesting for the consumer and military market, but also makes them more complex than many existing wireless networks (such as GSM). The distinct properties of mobile ad hoc networks have given rise to various new problems and challenges. These can be very practical (such as message routing) and theoretical. This paper focusses on the more theoretical aspects of mobile ad hoc networks and con- siders a graph model for such networks. As will be shown, a mobile ad hoc network can be naturally modeled as a so called (unit) disk graph. Each node in such a graph has a disk around it containing all points reachable by that node. The intersections of these disks then ∗This research was partially supported by the Netherlands Organisation for Scientific Research NWO (project Treewidth and Combinatorical Optimisation). 1 2 1 INTRODUCTION determine the edges of the graph. As these graphs have a nice geometric interpretation, we may hope that classical graph theoretic problems that are relevant for mobile ad hoc networks (such as Maximum Independent Set and Minimum (Connected) Dominating Set) are easier to solve or approximate than they are on general graphs. We show that by making some realistic assumptions about this geometric interpretation, various new properties and algorithms can be found, which improve on known results. 1.1 Preliminaries Unit disk graphs are a special kind of (geometric) intersection graphs. Hence, we first define these graphs. Definition 1.1 Let S be a set of geometric objects. Then the graph G = (V, E), where each vertex corresponds to an object in S and two vertices are connected by an edge if and only if the two corresponding objects intersect, is called an intersection graph. The graph G is said to be realized by S. In this definition, tangent objects are assumed to intersect. We can now formally define (unit) 2 disk graphs. Denote by ci ∈ R the center and by ri the radius of a disk Di. Definition 1.2 A graph G is a disk graph if and only if there exists a set of disks D = {Di | i = 1, . , n}, such that G is the intersection graph of D. The set of disks is called a disk representation of G. A disk graph can be given without its disk representation. In this case, it is assumed each vertex knows the vertices adjacent to it. However, knowing a disk representation can help to more efficiently solve problems on disk graphs. Definition 1.3 A graph G is a unit disk graph if and only if G is a disk graph and the radii of a set of disks realizing G are equal. 1 Usually the common radius is 1, but often it is assumed to be 2 . Note that any common radius can be obtained by scaling D appropriately. We use the following notation. Notation 1.4 Let G = (V, E) be a disk graph with disk representation D = {Di | i = 1, . , n}. For a vertex v ∈ V , we denote the corresponding disk in D by Dv, its center by cv, and its radius by rv. For a disk center ci of some disk in D, we denote the vertex v ∈ V corresponding to that disk by v(ci). Observe that (unit) disk graphs are a good model for mobile ad hoc networks. Each node of the network corresponds to a disk center and the transmission range of a node corresponds to the radius of the disk. In a unit disk graph, all nodes are assumed to have the same transmission range. We also define the various approximation scheme types considered in this paper. Definition 1.5 Let P be a maximization (minimization) problem. Then an algorithm A is a • polynomial-time approximation scheme (PTAS) for P if and only if for any instance x of P and for any (fixed) > 0, A(x, ) runs in time polynomial in |x| and delivers a feasible solution with value SOLx,, such that SOLx, ≥ (1 − )OP Tx (SOLx, ≤ (1 + )OP Tx). 1.2 Problem definitions 3 • fully polynomial-time approximation scheme (FPTAS) for P if and only if for any 1 instance x of P and for any > 0, A(x, ) runs in time polynomial in |x| and and delivers a feasible solution with value SOLx,, such that SOLx, ≥ (1 − )OP Tx (SOLx, ≤ (1 + )OP Tx). • asymptotic fully polynomial-time approximation scheme (FPTAS∞) for P if and only if for any instance x of P and for any > 0, A(x, ) runs in time polynomial in 1 |x| and and delivers a feasible solution with value SOLx,. If |x| > c, then also SOLx, ≥ (1 − )OP Tx (SOLx, ≤ (1 + )OP Tx). Finally, we define fixed-parameter tractability, following Downey and Fellows [19]. Definition 1.6 Let hx, ki be an instance of a parameterized problem P , with parameter k ∈ N. Then P is fixed-parameter tractable (FPT) if and only if there exists an algorithm that delivers a feasible solution for hx, ki in running time O(f(k) poly(|x|)) for all x, where f is an arbitrary function and poly(|x|) is an arbitrary polynomial in |x|. Note that a fixed-parameter tractable problem can be solved in polynomial time, given any fixed k. 1.2 Problem definitions We consider various classical optimization problems on graphs, relevant to (unit) disk graph models of mobile ad hoc networks. Definition 1.7 Let G = (V, E) be a graph. A set S ⊆ V is an independent set if and only if there are no u, v ∈ S, such that (u, v) ∈ E. A set S ⊆ V is a vertex cover if and only if for each (u, v) ∈ E it holds that u ∈ S or v ∈ S. Observe that an independent set is the complement of a vertex cover (and vice versa) [22]. Furthermore, we are usually looking for a maximum independent set and a minimum vertex cover. An independent set is maximum if and only if there is no independent set of greater size. A similar definition holds for minimum vertex cover. In the context of mobile ad hoc networks, an independent set of a (unit) disk graph can be seen as a set of nodes that can transmit simultaneously without signal interferences. Vertex covers are mostly interesting from a theoretical point of view. Definition 1.8 Let G = (V, E) be a graph. A set S ⊆ V is a dominating set if and only if for each vertex v either v ∈ S or there exists a vertex u ∈ S for which (u, v) ∈ E. Definition 1.9 Let G = (V, E) be a graph. A set S ⊆ V is a connected dominating set if and only if S is a dominating set and the subgraph of G induced by S (G[S] = (S, (S ×S)∩E)) is connected. A dominating set in a mobile ad hoc network can be seen as a set of emergency transmitters capable of reaching every node in the network, or as central nodes in node clusters. A connected dominating set can be used as a backbone for easier and faster communications. The problem is to find a minimum (connected) dominating set. 4 1 INTRODUCTION 1.3 Previous work All problems mentioned above are NP-hard for general graphs (see Garey and Johnson [22]). Since (unit) disk graphs are a restricted class of graphs with a nice geometric interpretation, one might hope that these problems are better solvable. Unfortunately, Clark, Colbourn, and Johnson [16] proved these problems to be NP-hard on (unit) disk graphs as well.
Load more

Recommended publications
  • Disk Intersection Graphs: Models, Data Structures, and Algorithms
    Disk Intersection Graphs: Models, Data Structures, and Algorithms Dissertation zur Erlangung des Doktorgrades vorgelegt am Fachbereich Mathematik und Informatik der Freien Universität Berlin von Paul Seiferth 2016 Erstgutachter: Prof. Dr. Wolfgang Mulzer Zweitgutachter: Prof. Dr. Christian Knauer Tag der Disputation: 19.08.2016 iii Abstract 2 Let P R be a set of n point sites. The unit disk graph UD(P) on P has vertex ⊂ set P and an edge between two sites p, q P if and only if p and q have Euclidean 2 distance jpqj 6 1. If we interpret P as centers of disks with diameter 1, then UD(P) is the intersection graph of these disks, i.e., two sites p and q form an edge if and only if their corresponding unit disks intersect. Two natural generalizations of unit disk graphs appear when we assign to each point p P an associated radius r > 0. The first one is 2 p the disk graph D(P), where we put an edge between p and q if and only if jpqj 6 rp +rq, meaning that the disks with centers p and q and radii rp and rq intersect. The second one yields a directed graph on P, called the transmission graph of P. We obtain it by putting a directed edge from p to q if and only if jpqj 6 rp, meaning that q lies in the disk with center p and radius rp. For disk and transmission graphs we define the radius ratio Ψ to be the ratio of the largest and the smallest radius that is assigned to a site in P.
    [Show full text]
  • Algorithms on Geometric Graphs
    M. Tech. (Computer Science) Dissertation Algorithms on Geometric Graphs A dissertation submitted in partial fulfillment of the requirements for the award of M.Tech.(Computer Science) degree By Minati De Roll No: CS0805 under the supervision of Professor Subhas C. Nandy Advanced Computing and Microelectronics Unit INDIANSTATISTICALINSTITUTE 203, Barrackpore Trunk Road Kolkata - 700 108 Acknowledgement At the end of this course, it is my pleasure to thank everyone who has helped me along the way. First of all, I want to express my sincere gratitude to my supervisor, Prof. Subhas C. Nandy, for introducing me to the world of computational geometry and giving me interesting problems. I have learnt a lot from him. For his patience, for all his advice and encouragement and for the way he helped me to think about problems with a broader perspective, I will always be grateful. I would like to thank all the professors at ISI who have made my educational life exciting and helped me to gain a better outlook on computer science. I would also like to express my gratitude to Prof. B. P. Sinha, Prof. Arijit Bishnu, Goutam K. Das, Daya Gour for interesting discussions. I would like to thank everybody at ISI for providing a wonderful atmosphere for pursuing my studies. I thank all my classmates who have made the academic and non-academic experience very delightful. Special thanks to my friends Somindu-di, Debosmita-di, Ishita, Anindita-di, Aritra-da, Butu-da, Koushik, Anisur, Soumyot- tam, Joydeep and many others who made my campus life so enjoyable. It has been great having them around at all times, good or bad.
    [Show full text]
  • Maximum Clique in Disk-Like Intersection Graphs
    Maximum Clique in Disk-Like Intersection Graphs Édouard Bonnet Univ Lyon, CNRS, ENS de Lyon, Université Claude Bernard Lyon 1, LIP UMR5668, France [email protected] Nicolas Grelier Department of Computer Science, ETH Zürich [email protected] Tillmann Miltzow Utrecht University, Utrecht Netherlands [email protected] Abstract We study the complexity of Maximum Clique in intersection graphs of convex objects in the plane. On the algorithmic side, we extend the polynomial-time algorithm for unit disks [Clark ’90, Raghavan and Spinrad ’03] to translates of any fixed convex set. We also generalize the efficient polynomial-time approximation scheme (EPTAS) and subexponential algorithm for disks [Bonnet et al. ’18, Bonamy et al. ’18] to homothets of a fixed centrally symmetric convex set. The main open question on that topic is the complexity of Maximum Clique in disk graphs. It is not known whether this problem is NP-hard. We observe that, so far, all the hardness proofs for Maximum Clique in intersection graph classes I follow the same road. They show that, for every graph G of a large-enough class C, the complement of an even subdivision of G belongs to the intersection class I. Then they conclude invoking the hardness of Maximum Independent Set on the class C, and the fact that the even subdivision preserves that hardness. However there is a strong evidence that this approach cannot work for disk graphs [Bonnet et al. ’18]. We suggest a new approach, based on a problem that we dub Max Interval Permutation Avoidance, which we prove unlikely to have a subexponential-time approximation scheme.
    [Show full text]
  • Linear-Time Approximation Algorithms for Unit Disk Graphs
    Linear-Time Approximation Algorithms for Unit Disk Graphs Guilherme D. da Fonseca Vin´ıciusG. Pereira de S´a Celina M. H. de Figueiredo Universidade Federal do Rio de Janeiro, Brazil Abstract Numerous approximation algorithms for unit disk graphs have been proposed in the literature, exhibiting sharp trade-offs between running times and approximation ratios. We propose a method to obtain linear-time approximation algorithms for unit disk graph problems. Our method yields linear-time (4 + ")-approximations to the maximum-weight independent set and the minimum dominating set, as well as a linear-time approximation scheme for the minimum vertex cover, improving upon all known linear- or near-linear-time algorithms for these problems. 1 Introduction A unit disk graph is the intersection graph of unit disks in the plane. Unit disk graphs are often represented using the coordinates of the disk centers instead of explicit adjacency information. In this geometric setting, two vertices are adjacent if the corresponding points (the disk centers) are within Euclidean distance at most 2 from one another. Owing to their applicability in wireless networks [10, 13], numerous approximation algorithms for unit disk graphs have been proposed in the literature. Such approxima- tions are either graph-based algorithms, when they receive as input solely the adjacency representation of the graph, or geometric algorithms, when the input consists of a geo- metric representation of the graph. While the edges of a graph G(V; E), with n = V and m = E , can be obtained from the vertices' coordinates in O(n + m) time under thej j real-RAMj modelj with floor function and constant-time hashing [3], obtaining a geometric representation of a given unit disk graph is NP-hard [4].
    [Show full text]
  • Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs
    Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs A. Karim Abu-Affash1 Software Engineering Department, Shamoon College of Engineering Beer-Sheva 84100, Israel [email protected] Paz Carmi2 Department of Computer Science, Ben-Gurion University Beer-Sheva 84105, Israel [email protected] Anil Maheshwari3 School of Computer Science, Carleton University Ottawa, Canada [email protected] Pat Morin4 School of Computer Science, Carleton University Ottawa, Canada [email protected] Michiel Smid5 School of Computer Science, Carleton University Ottawa, Canada [email protected] Shakhar Smorodinsky6 Department of Mathematics, Ben-Gurion University Beer-Sheva 84105, Israel [email protected] Abstract We consider a well studied generalization of the maximum clique problem which is defined as follows. Given a graph G on n vertices and an integer d ≥ 1, in the maximum diameter-bounded subgraph problem (MaxDBS for short), the goal is to find a (vertex) maximum subgraph of G of diameter at most d. For d = 1, this problem is equivalent to the maximum clique problem and thus it is NP-hard to approximate it within a factor n1−, for any > 0. Moreover, it is known that, for any d ≥ 2, it is NP-hard to approximate MaxDBS within a factor n1/2−, for any > 0. In this paper we focus on MaxDBS for the class of unit disk graphs. We provide a polynomial- time constant-factor approximation algorithm for the problem. The approximation ratio of our algorithm does not depend on the diameter d. Even though the algorithm itself is simple, its analysis is rather involved.
    [Show full text]
  • Approximation Algorithms for Maximum Independent Set of a Unit Disk Graph ∗ Gautam K
    Information Processing Letters 115 (2015) 439–446 Contents lists available at ScienceDirect Information Processing Letters www.elsevier.com/locate/ipl Approximation algorithms for maximum independent set of a unit disk graph ∗ Gautam K. Das a, Minati De b, Sudeshna Kolay c, Subhas C. Nandy d, , Susmita Sur-Kolay d a Dept. of Mathematics, Indian Institute of Technology Guwahati, Guwahati, India b Dept. of Computer Science, The Technion—Israel Institute of Technology, Israel c The Institute of Mathematical Sciences, Chennai, India d Indian Statistical Institute, Kolkata, India a r t i c l e i n f o a b s t r a c t Article history: We propose a 2-approximation algorithm for the maximum independent set problem for a 3 2 Received 21 November 2013 unit disk graph. The time and space complexities are O (n ) and O (n ), respectively. For a Received in revised form 5 November 2014 penny graph, our proposed 2-approximation algorithm works in O (n log n) time using O (n) Accepted 6 November 2014 space. We also propose a polynomial-time approximation scheme (PTAS) for the maximum Available online 15 November 2014 independent set problem for a unit disk graph. Given an integer k > 1, it produces a Communicated by R. Uehara solution of size 1 |OPT| in O (k4nσk log k + n logn) time and O (n + k logk) space, where + 1 2 (1 k ) Keywords: ≤ 7k + OPT is the subset of disks in an optimal solution and σk 3 2. For a penny graph, the Maximum independent set 1 | | 2σk + Unit disk graph proposed PTAS produces a solution of size + 1 OPT in O (2 nk n logn) time using (1 k ) Approximation algorithms O (2σk + n) space.
    [Show full text]
  • On Forbidden Induced Subgraphs for Unit Disk Graphs
    On forbidden induced subgraphs for unit disk graphs Aistis Atminas∗ Viktor Zamaraevy Abstract A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of minimal forbidden induced subgraphs. In spite of quite active study of unit disk graphs very little is known about minimal forbidden induced subgraphs for this class. We found only finitely many minimal non unit disk graphs in the literature. In this paper we study in a systematic way forbidden induced subgraphs for the class of unit disk graphs. We develop several structural and geometrical tools, and use them to reveal infinitely many new minimal non unit disk graphs. Further we use these results to investigate structure of co-bipartite unit disk graphs. In particular, we give structural characterization of those co-bipartite unit disk graphs whose edges between parts form a C4-free bipartite graph, and show that bipartite complements of these graphs are also unit disk graphs. Our results lead us to propose a conjecture that the class of co-bipartite unit disk graphs is closed under bipartite complementation. 1 Introduction A graph is unit disk graph (UDG for short) if its vertices can be represented as points in the plane such that two vertices are adjacent if and only if the corresponding points are at distance at most 1 from each other. Unit disk graphs has been very actively studied in recent decades. One of the reasons for this is that UDGs appear to be useful in number of applications.
    [Show full text]
  • University of Oxford on Improper Colouring of Unit Disk Graphs
    University of Oxford On improper colouring of unit disk graphs Ross J. Kang Lady Margaret Hall Submitted for transfer of status to DPhil candidacy January 2005 Department of Statistics, 1 South Parks Road, Oxford I certify that this is my own work (except where otherwise indicated). Candidate . Signed. Dated . Abstract In this paper, we examine the problem of finding the defective chromatic number of unit disk graphs. In the introduction, we survey the current state of research into im- proper colouring and into unit disk graphs. This is intended not only to pro- vide background for the following chapter, but also to give a self-contained overview of these two interesting fields of research. Most of the original work is in the second chapter, where we show that the unit disk improper colourability problem is NP-complete in nearly all cases. This work is joint work with Jean-S´ebastien Sereni (Universit´e de Nice and INRIA, France), a fellow doctoral student with whom I worked while on an academic visit to INRIA in Sophia Antipolis. The concluding chapter gives some open problems to consider, some specific to improper colouring of unit disk graphs but others under the topic of (colouring) unit disk graphs in general. Contents 1 Introduction 3 1.1 Unit disk graphs . 3 1.1.1 Classes of graphs related to unit disk graphs . 4 1.1.2 Complexity on restriction to unit disk graphs . 5 1.1.3 The unit disk colourability problem . 8 1.2 Improper colouring . 9 1.2.1 General results on improper (list) colouring .
    [Show full text]
  • Optimization in Geometric Graphs: Complexity And
    OPTIMIZATION IN GEOMETRIC GRAPHS: COMPLEXITY AND APPROXIMATION A Dissertation by SERA KAHRUMAN-ANDEROGLU Submitted to the O±ce of Graduate Studies of Texas A&M University in partial ful¯llment of the requirements for the degree of DOCTOR OF PHILOSOPHY December 2009 Major Subject: Industrial Engineering °c 2009 SERA KAHRUMAN-ANDEROGLU ALL RIGHTS RESERVED OPTIMIZATION IN GEOMETRIC GRAPHS: COMPLEXITY AND APPROXIMATION A Dissertation by SERA KAHRUMAN-ANDEROGLU Submitted to the O±ce of Graduate Studies of Texas A&M University in partial ful¯llment of the requirements for the degree of DOCTOR OF PHILOSOPHY Approved by: Chair of Committee, Sergiy I. Butenko Committee Members, Illya V. Hicks Lewis Ntaimo Vivek Sarin Head of Department, Brett A. Peters December 2009 Major Subject: Industrial Engineering iii ABSTRACT Optimization in Geometric Graphs: Complexity and Approximation. (December 2009) Sera Kahruman-Anderoglu, B.S., Bogazici University Chair of Advisory Committee: Dr. Sergiy I. Butenko We consider several related problems arising in geometric graphs. In particular, we investigate the computational complexity and approximability properties of sev- eral optimization problems in unit ball graphs and develop algorithms to ¯nd exact and approximate solutions. In addition, we establish complexity-based theoretical justi¯cations for several greedy heuristics. Unit ball graphs, which are de¯ned in the three dimensional Euclidian space, have several application areas such as computational geometry, facility location and, par- ticularly, wireless communication networks. E±cient operation of wireless networks involves several decision problems that can be reduced to well known optimization problems in graph theory. For instance, the notion of a \virtual backbone" in a wire- less network is strongly related to a minimum connected dominating set in its graph theoretic representation.
    [Show full text]
  • Efficient Sub-5 Approximations for Minimum Dominating Sets in Unit
    Efficient sub-5 approximations for minimum dominating sets in unit disk graphsI G.D. da Fonsecaa, C.M.H. de Figueiredo1, V.G. Pereira de S´a1, R.C.S. Machadoc aUniversidade Federal do Estado do Rio de Janeiro, Brazil bUniversidade Federal do Rio de Janeiro, Brazil cInstituto Nacional de Metrologia, Qualidade e Tecnologia, Brazil Abstract A unit disk graph is the intersection graph of n congruent disks in the plane. Dominating sets in unit disk graphs are widely studied due to their applicabil- ity in wireless ad-hoc networks. Because the minimum dominating set prob- lem for unit disk graphs is NP-hard, numerous approximation algorithms have been proposed in the literature, including some PTASs. However, since the proposal of a linear-time 5-approximation algorithm in 1995, the lack of efficient algorithms attaining better approximation factors has aroused at- tention. We introduce an O(n+m) algorithm that takes the usual adjacency representation of the graph as input and outputs a 44=9-approximation. This approximation factor is also attained by a second algorithm, which takes the geometric representation of the graph as input and runs in O(n log n) time regardless of the number of edges. Additionally, we propose a 43=9- approximation which can be obtained in O(n2m) time given only the graph's adjacency representation. It is noteworthy that the dominating sets obtained by our algorithms are also independent sets. Keywords: approximation algorithms; dominating set; unit disk graph. IThis is a manuscript by the authors. The final article was published by Elsevier with DOI number 10.1016/j.tcs.2014.01.023.
    [Show full text]
  • QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs Edouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzążewski, Florian Sikora
    QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs Edouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzążewski, Florian Sikora To cite this version: Edouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzążewski, Florian Sikora. QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. SoCG 2018, Jun 2018, Budapest, Hungary. 10.4230/LIPIcs. hal-01991635 HAL Id: hal-01991635 https://hal.archives-ouvertes.fr/hal-01991635 Submitted on 23 Jan 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs Édouard Bonnet1, Panos Giannopoulos1, Eun Jung Kim2, Paweł Rzążewski3, and Florian Sikora2 1 Department of Computer Science, Middlesex University, London [email protected], [email protected] 2 Université Paris-Dauphine, PSL Research University, CNRS UMR, LAMSADE, Paris, France {eun-jung.kim,florian.sikora}@dauphine.fr 3 Faculty of Mathematics and Information Science, Warsaw University of Technology [email protected] 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 Clique on unit disk graphs [Clark, Colbourn, Johnson; Discrete Mathematics ’90].
    [Show full text]
  • Minimum Clique Partition in Unit Disk Graphs
    Minimum clique partition in unit disk graphs Adrian Dumitrescu1, J´anos Pach2 1 University of Wisconsin–Milwaukee, USA; e-mail: [email protected]. Supported in part by NSF CAREER grant CCF-0444188. Part of the research by this author was done at Ecole Polytechnique F´ed´erale de Lausanne. 2 Ecole Polytechnique F´ed´erale de Lausanne and City College, New York; e-mail: [email protected]. Research partially supported by NSF grant CCF-08-30272, grants from OTKA, SNF, and PSC-CUNY. Abstract. The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corre- sponding unit disk graph (UDG) has these points as vertices, and edges connecting points at distance at most 1. MCP in unit disk graphs is known to be NP-hard and several constant factor approximations are known, including a recent PTAS. We present two improved approximation algorithms for minimum clique partition in unit disk graphs with a realization: 2 (I) A polynomial time approximation scheme (PTAS) running in time nO(1/ε ). This improves 4 on a previous PTAS with nO(1/ε ) running time [23]. (II) A randomized quadratic-time algorithm with approximation ratio 2.16. This improves on a ratio 3 algorithm with O(n2) running time [7]. Key words. Unit disk graph, clique partition. 1. Introduction Unit disk graphs (UDGs) can be defined in three equivalent ways, as follows [8]: (i) For n points in the plane, form a graph with n vertices corresponding to the n points, and an edge between two vertices if and only if the distance between the two points is at most 1.
    [Show full text]