A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation
[article]
2021
arXiv
pre-print
An upper dominating set is a minimal dominating set in a graph. In the Upper Dominating Set problem, the goal is to find an upper 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 ETH, k-Upper Dominating Set cannot be solved in time O(n^o(k)) (improving on O(n^o(√(k)))), and in the same time we show under the same complexity assumption that for any constant ratio
arXiv:2101.07550v1
fatcat:w4wzquzq2vbh3hma4gowxcvuuu