Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation

Abstract

In the Upper Dominating Set problem, the goal is to find a minimal dominating set of maximum size. We study the complexity of parameterized algorithms for Upper Dominating Set, as well as its sub-exponential approximation. First, we prove that, under the ETH, Upper Dominating Set cannot be solved in time O(no(k)) (improving on O(no(k))), and in the same time we show under the same complexity assumption that for any constant ratio r and any ε>0, there is no r-approximation algorithm running in time O(nk1−ε). Then, we settle the problem's complexity parameterized by pathwidth by giving an algorithm running in time O⁎(6pw) (improving the current best O⁎(7pw)), and a lower bound showing that our algorithm is the best we can get under the SETH. Furthermore, we obtain a simple sub-exponential approximation algorithm for this problem: an algorithm that produces an r-approximation in time nO(n/r), for any desired approximation ratio r<n. We finally show that this time-approximation trade-off is tight, up to an arbitrarily small constant in the second exponent: under the randomized ETH, and for any ratio r>1 and ε>0, no algorithm can output an r-approximation in time n(n/r)1−ε. Hence, we completely characterize the approximability of the problem in sub-exponential time.