# Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9294)

## Abstract

We study a general family of facility location problems defined on planar graphs and on the 2-dimensional plane. In these problems, a subset of k objects has to be selected, satisfying certain packing (disjointness) and covering constraints. Our main result is showing that, for each of these problems, the $$n^{{\mathcal{O}}(k)}$$ time brute force algorithm of selecting k objects can be improved to $$n^{{\mathcal{O}}(\sqrt{k})}$$ time. The algorithm is based on focusing on the Voronoi diagram of a hypothetical solution of k objects; this idea was introduced recently in the design of geometric QPTASs, but was not yet used for exact algorithms and for planar graphs. As concrete consequences of our main result, we obtain $$n^{{\mathcal{O}}(\sqrt{k})}$$ time algorithms for the following problems: d-Scattered Set in planar graphs (find k vertices at pairwise distance d); d-Dominating Set/(k,d)-Center in planar graphs (find k vertices such that every vertex is at distance at most d from these vertices); select k pairwise disjoint connected vertex sets from a given collection; select k pairwise disjoint disks in the plane (of possibly different radii) from a given collection; cover a set of points in the plane by selecting k disks/axis-parallel squares from a given collection. We complement these positive results with lower bounds suggesting that some similar, but slightly more general problems (such as covering points with axis-parallel rectangles) do not admit $$n^{{\mathcal{O}}(\sqrt{k})}$$ time algorithms.

## References

1. 1.
Adamaszek, A., Wiese, A.: Approximation schemes for maximum weight independent set of rectangles. In: FOCS, pp. 400–409 (2013)Google Scholar
2. 2.
Adamaszek, A., Wiese, A.: A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices. In: SODA, pp. 645–656 (2014)Google Scholar
3. 3.
Agarwal, P.K., Overmars, M.H., Sharir, M.: Computing maximally separated sets in the plane. SIAM J. Comput. 36(3), 815–834 (2006)
4. 4.
Alber, J., Fiala, J.: Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. J. Algorithms 52(2), 134–151 (2004)
5. 5.
Chitnis, R.H., Hajiaghayi, M., Marx, D.: Tight bounds for Planar Strongly Connected Steiner Subgraph with fixed number of terminals (and extensions). In: SODA, pp. 1782–1801 (2014)Google Scholar
6. 6.
Demaine, E.D., Hajiaghayi, M.: The bidimensionality theory and its algorithmic applications. Comput. J. 51(3), 292–302 (2008)
7. 7.
Har-Peled, S.: Quasi-polynomial time approximation scheme for sparse subsets of polygons. In: SoCG, pp. 120 (2014)Google Scholar
8. 8.
Hwang, R.Z., Lee, R.C.T., Chang, R.C.: The slab dividing approach to solve the Euclidean p-center problem. Algorithmica 9(1), 1–22 (1993)
9. 9.
Klein, P.N., Marx, D.: Solving Planar k -Terminal Cut in $$O(n^{c \sqrt{k}})$$ Time. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol. 7391, pp. 569–580. Springer, Heidelberg (2012)
10. 10.
Klein, P.N., Marx, D.: A subexponential parameterized algorithm for Subset TSP on planar graphs. In: SODA, pp. 1812–1830 (2014)Google Scholar
11. 11.
Marx, D., Pilipczuk, M.: Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. CoRR, abs/1504.05476 (2015)Google Scholar
12. 12.
Marx, D., Sidiropoulos, A.: The limited blessing of low dimensionality: when 1 − 1/d is the best possible exponent for d-dimensional geometric problems. In: SoCG, p. 67 (2014)Google Scholar
13. 13.
Mustafa, N.H., Raman, R., Ray, S.: QPTAS for geometric set-cover problems via optimal separators. CoRR, abs/1403.0835 (2014)Google Scholar
14. 14.
Pilipczuk, M., Pilipczuk, M., Sankowski, P., van Leeuwen, E.J.: Network sparsification for Steiner problems on planar and bounded-genus graphs. In: FOCS, pp. 276–285. IEEE Computer Society (2014)Google Scholar
15. 15.
Pătraşcu, M., Williams, R.: On the possibility of faster SAT algorithms. In: SODA, pp. 1065–1075 (2010)Google Scholar