In (k, r)-Center we are given a (possibly edge-weighted) graph and are asked to select at most k vertices (centers), so that all other vertices are at distance at most r from a center. In this paper we provide a number of tight fine-grained bounds on the complexity of this problem with respect to various standard graph parameters. Specifically:• For any r ≥ 1, we show an algorithm that solves the problem in O * ((3r + 1) cw ) time, where cw is the clique-width of the input graph, as well as a tight SETH lower bound matching this algorithm's performance. As a corollary, for r = 1, this closes the gap that previously existed on the complexity of Dominating Set parameterized by cw.• We strengthen previously known FPT lower bounds, by showing that (k, r)-Center is W[1]-hard parameterized by the input graph's vertex cover (if edge weights are allowed), or feedback vertex set, even if k is an additional parameter. Our reductions imply tight ETH-based lower bounds. Finally, we devise an algorithm parameterized by vertex cover for unweighted graphs.• We show that the complexity of the problem parameterized by tree-depth is 2 Θ(td 2 ) , by showing an algorithm of this complexity and a tight ETH-based lower bound.We complement these mostly negative results by providing FPT approximation schemes parameterized by clique-width or treewidth, which work efficiently independently of the values of k, r. In particular, we give algorithms which, for any > 0, run in time O * ((tw/ ) O(tw) ), O * ((cw/ ) O(cw) ) and return a (k, (1 + )r)-center if a (k, r)-center exists, thus circumventing the problem's W-hardness.
In d-Scattered Set we are given an (edge-weighted) graph and are asked to select at least k vertices, so that the distance between any pair is at least d, thus generalizing Independent Set. We provide upper and lower bounds on the complexity of this problem with respect to various standard graph parameters. In particular, we show the following:• For any d ≥ 2, an O * (d tw )-time algorithm, where tw is the treewidth of the input graph and a tight SETH-based lower bound matching this algorithm's performance. These generalize known results for Independent Set.• d-Scattered Set is W[1]-hard parameterized by vertex cover (for edge-weighted graphs), or feedback vertex set (for unweighted graphs), even if k is an additional parameter.• A single-exponential algorithm parameterized by vertex cover for unweighted graphs, complementing the above-mentioned hardness.• A 2 O(td 2 ) -time algorithm parameterized by tree-depth (td), as well as a matching ETHbased lower bound, both for unweighted graphs.We complement these mostly negative results by providing an FPT approximation scheme parameterized by treewidth. In particular, we give an algorithm which, for any error parameter > 0, runs in time O * ((tw/ ) O(tw) ) and returns a d/(1+ )-scattered set of size k, if a d-scattered set of the same size exists. IntroductionIn this paper we study the d-Scattered Set problem: given graph G = (V, E) and a metric weight function w : E → N + that gives the length of each edge, we are asked if there exists a set K of at least k selections from V , such that the distance between any pair v, u ∈ K is at least d(v, u) ≥ d, where d(v, u) denotes the shortest-path distance from v to u under weight function w. If w assigns weight 1 to all edges, the variant is called unweighted.The problem can already be seen to be hard, as it generalizes Independent Set (for d = 2), even to approximate (under standard complexity assumptions), i.e. the optimal k cannot be approximated to n 1− in polynomial time [19], while an alternative name is 28,13]. This hardness prompts the analysis of the problem when the input graph is of restricted structure, our aim being to provide a comprehensive account of the complexity of d-Scattered Set through various upper and lower bound results. Our viewpoint is parameterized: we consider the well-known structural parameters treewidth tw, tree-depth td, vertex cover number vc and feedback vertex set number fvs, that comprehensively express the intended restrictions on the input graph's structure (as they range in size and applicability), while we examine both the edge-weighted and unweighted variants of the problem. 1
In d-Scattered Set we are given an (edge-weighted) graph and are asked to select at least k vertices, so that the distance between any pair is at least d, thus generalizing Independent Set. We provide upper and lower bounds on the complexity of this problem with respect to various standard graph parameters. In particular, we show the following:• For any d ≥ 2, an O * (d tw )-time algorithm, where tw is the treewidth of the input graph and a tight SETH-based lower bound matching this algorithm's performance. These generalize known results for Independent Set.• d-Scattered Set is W[1]-hard parameterized by vertex cover (for edge-weighted graphs), or feedback vertex set (for unweighted graphs), even if k is an additional parameter.• A single-exponential algorithm parameterized by vertex cover for unweighted graphs, complementing the above-mentioned hardness.• A 2 O(td 2 ) -time algorithm parameterized by tree-depth (td), as well as a matching ETHbased lower bound, both for unweighted graphs.We complement these mostly negative results by providing an FPT approximation scheme parameterized by treewidth. In particular, we give an algorithm which, for any error parameter > 0, runs in time O * ((tw/ ) O(tw) ) and returns a d/(1+ )-scattered set of size k, if a d-scattered set of the same size exists. arXiv:1709.02180v4 [cs.CC] 10 Nov 2018Our contribution: First, in Section 3 we present a lower bound of (d − ) tw · n O(1) on the complexity of any algorithm solving d-Scattered Set parameterized by tw, based on the Strong Exponential Time Hypothesis (SETH [19,20]). This result can be seen as a non-trivial extension of the bound of (2 − ) tw · n O(1) for Independent Set ([24]) for larger values of d, for which the construction is required to be much more compact in terms of encoded information per unit of treewidth. Next, in Section 4 we provide a dynamic programming algorithm of running time O * (d tw ), matching this lower bound, over a given tree decomposition of width tw. The algorithm actually solves the counting version of d-Scattered Set, making use of standard techniques (dynamic programming on tree decompositions), with an application of the fast subset convolution technique of [2] (or state changes [7,30]) to bring the running time down to match the size of the dynamic programming tables.Having thus identified the complexity of the problem with respect to tw, we next focus on the more restrictive parameters vc and fvs and we show in Section 5 that the edge-weighted d-Scattered Set problem parameterized by vc + k is W[1]-hard. If, on the other hand, all edge-weights are set to 1, then d-Scattered Set (the unweighted variant) parameterized by fvs + k is W[1]-hard. Our reductions also imply lower bounds based on the Exponential Time Hypothesis (ETH [19,20]), yet we do not believe these to be tight, due to the quadratic increase in parameter size (as the construction's focus lies on the edges). One observation we can make is that there are few cases where we can expect to obtain an FPT algorithm without bounding the va...
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.