fixed-parameter algorithms for (strongkstrong r)-center in planar graphs.pdfVIP

Fixed-Parameter Algorithms for (k,r )-Center in Planar Graphs and Map Graphs ERIK D. DEMAINE MIT, Cambridge, Massachusetts FEDOR V. FOMIN University of Bergen, Bergen, Norway MOHAMMADTAGHI HAJIAGHAYI MIT, Cambridge, Massachusetts AND DIMITRIOS M. THILIKOS ` Universitat Politecnica de Catalunya, Barcelona, Spain Abstract. The (k , r )-center problem asks whether an input graph G has k vertices (called centers) such that every vertex of G is within distance r from some center. In this article, we prove that the (k , r )-center problem, parameterized by k and r , is fixed-parameter tractable (FPT) on planar graphs, i.e., it admits an algorithm of complexity f (k , r )n O (1) where the function f is independent of n . In particular, we show that f (k , r ) = 2O (r log r )k , where the exponent of the exponential term grows sublinearly in the number of centers. Moreover, we prove that the same type of FPT algorithms can be designed for the more general class of map graphs introduced by Chen, Grigni, and Papadimitriou. Our results combine dynamic-programming algorithms for graphs of small branchwidth and a graph- theoretic result bounding this parameter in terms of k and r . Finally, a byproduct of our algorithm is the existence of a PTAS for the r -domination problem in both planar graphs and map graphs. Our approach builds on the seminal results of Robertson and Seymour on Graph Minors, and as a result is much more powerful than the previous machinery of Alber et al. for exponential speedup A preliminary version of this article appeared in the Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP’03). F. Fomin is supported by Norges forskn- ingsr¨ad projects 162731/V00 and 160778/V30. D. Thilikos is supported by the Spanish CICYT Project TIN-2004-07925 (GRAMMARS). Authors’ addresses: E. D. Demaine, M. Hajiaghayi, MIT Computer Science and Artificial Intelli- gence Laboratory,