Fixed-parameter algorithms for the (k,r)-center in planar graphs and map graphs
The (k,r)-center problem} asks whether an input graph G has atr most k vertices (called centers) such that every vertex of $ is within distance at most r from some center. In this paper we prove that the (k,r)-center problem, parameterized by k and r, is fixed-parameter tractable (FPT) on planar gra...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2003 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/96917 |
| Acceso en línea: | https://hdl.handle.net/2117/96917 |
| Access Level: | acceso abierto |
| Palabra clave: | Planar graphs Map graphs Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | The (k,r)-center problem} asks whether an input graph G has atr most k vertices (called centers) such that every vertex of $ is within distance at most r from some center. In this paper 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)=2^{O(rlog r) sqrt{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 on planar graphs. To demonstrate the versatility of our results, we show how our algorithms can be extended to general parameters that are |
|---|