14 research outputs found
Parameterized Local Search for Vertex Cover: When Only the Search Radius Is Crucial
A k-swap W for a vertex cover S of a graph G is a vertex set of size at most k such that S\u27 = (S ? W) ? (W ? S), the symmetric difference of S and W, is a vertex cover of G. If |S\u27| < |S|, then W is improving. In LS-Vertex Cover, one is given a vertex cover S of a graph G and wants to know if there is an improving k-swap for S in G. In applications of LS-Vertex Cover, k is a very small parameter that can be set by a user to determine the trade-off between running time and solution quality. Consequently, k can be considered to be a constant. Motivated by this and the fact that LS-Vertex Cover is W[1]-hard with respect to k, we aim for algorithms with running time ?^f(k) ? n^?(1) where ? is a structural graph parameter upper-bounded by n. We say that such a running time grows mildly with respect to ? and strongly with respect to k. We obtain algorithms with such a running time for ? being the h-index of G, the treewidth of G, or the modular-width of G. In addition, we consider a novel parameter, the maximum degree over all quotient graphs in a modular decomposition of G. Moreover, we adapt these algorithms to the more general problem where each vertex is assigned a weight and where we want to find a d-improving k-swap, that is, a k-swap which decreases the weight of the vertex cover by at least d
String Factorizations Under Various Collision Constraints
In the NP-hard Equality-Free String Factorization problem, we are given a string S and ask whether S can be partitioned into k factors that are pairwise distinct. We describe a randomized algorithm for Equality-Free String Factorization with running time 2^k? k^{?(1)}+?(n) improving over previous algorithms with running time k^{?(k)}+?(n) [Schmid, TCS 2016; Mincu and Popa, Proc. SOFSEM 2020]. Our algorithm works for the generalization of Equality-Free String Factorization where equality can be replaced by an arbitrary polynomial-time computable equivalence relation on strings. We also consider two factorization problems to which this algorithm does not apply, namely Prefix-Free String Factorization where we ask for a factorization of size k such that no factor is a prefix of another factor and Substring-Free String Factorization where we ask for a factorization of size k such that no factor is a substring of another factor. We show that these two problems are NP-hard as well. Then, we show that Prefix-Free String Factorization with the prefix-free relation is fixed-parameter tractable with respect to k by providing a polynomial problem kernel. Finally, we show a generic ILP formulation for R-Free String Factorization where R is an arbitrary relation on strings. This formulation improves over a previous one for Equality-Free String Factorization in terms of the number of variables
A Graph-Theoretic Formulation of Exploratory Blockmodeling
We present a new simple graph-theoretic formulation of the exploratory blockmodeling problem on undirected and unweighted one-mode networks. Our formulation takes as input the network G and the maximum number t of blocks for the solution model. The task is to find a minimum-size set of edge insertions and deletions that transform the input graph G into a graph G\u27 with at most t neighborhood classes. Herein, a neighborhood class is a maximal set of vertices with the same neighborhood. The neighborhood classes of G\u27 directly give the blocks and block interactions of the computed blockmodel.
We analyze the classic and parameterized complexity of the exploratory blockmodeling problem, provide a branch-and-bound algorithm, an ILP formulation and several heuristics. Finally, we compare our exact algorithms to previous ILP-based approaches and show that the new algorithms are faster for t ? 4
On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric
We initiate a study of the complexity of MSM-Median, the problem of computing a median of a set of k real-valued time series under the move-split-merge distance. This distance measure is based on three operations: moves, which may shift a data point in a time series; splits, which replace one data point in a time series by two consecutive data points of the same value; and merges, which replace two consecutive data points of equal value by a single data point of the same value. The cost of a move operation is the difference of the data point value before and after the operation, the cost of split and merge operations is defined via a given constant c.
Our main results are as follows. First, we show that MSM-Median is NP-hard and W[1]-hard with respect to k for time series with at most three distinct values. Under the Exponential Time Hypothesis (ETH) our reduction implies that a previous dynamic programming algorithm with running time |I|^?(k) [Holznigenkemper et al., Data Min. Knowl. Discov. \u2723] is essentially optimal. Here, |I| denotes the total input size. Second, we show that MSM-Median can be solved in 2^?(d/c)?|I|^?(1) time where d is the total distance of the median to the input time series
On the Complexity of Parameterized Local Search for the Maximum Parsimony Problem
Maximum Parsimony is the problem of computing a most parsimonious phylogenetic tree for a taxa set X from character data for X. A common strategy to attack this notoriously hard problem is to perform a local search over the phylogenetic tree space. Here, one is given a phylogenetic tree T and wants to find a more parsimonious tree in the neighborhood of T. We study the complexity of this problem when the neighborhood contains all trees within distance k for several classic distance functions. For the nearest neighbor interchange (NNI), subtree prune and regraft (SPR), tree bisection and reconnection (TBR), and edge contraction and refinement (ECR) distances, we show that, under the exponential time hypothesis, there are no algorithms with running time |I|^o(k) where |I| is the total input size. Hence, brute-force algorithms with running time |X|^?(k) ? |I| are essentially optimal.
In contrast to the above distances, we observe that for the sECR-distance, where the contracted edges are constrained to form a subtree, a better solution within distance k can be found in k^?(k) ? |I|^?(1) time
Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard
For PLS-complete local search problems, there is presumably no polynomial-time algorithm which finds a locally optimal solution, even though determining whether a solution is locally optimal and replacing it by a better one if this is not the case can be done in polynomial time.
We study local search for Weighted Independent Set and Weighted Dominating Set with the 3-swap neighborhood. The 3-swap neighborhood of a vertex set S in G is the set of vertex sets which can be obtained from S by exchanging at most three vertices. We prove the following dichotomy: On the negative side, the problem of finding a 3-swap-optimal independent set or dominating set is PLS-complete. On the positive side, locally optimal independent sets or dominating sets can be found in polynomial time when allowing all 3-swaps except a) the swaps that remove two vertices from the current solution and add one vertex to the solution or b) the swaps that remove one vertex from the current solution and add two vertices to the solution
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs
Given an undirected graph and integers and , the Maximum
Edge-Colorable Subgraph problem asks whether we can delete at most edges in
to obtain a graph that has a proper edge coloring with at most colors.
We show that Maximum Edge-Colorable Subgraph admits, for every fixed , a
linear-size problem kernel when parameterized by the edge deletion distance of
to a graph with maximum degree . This parameterization measures the
distance to instances that, due to Vizing's famous theorem, are trivial
yes-instances. For , we also provide a linear-size kernel for the same
parameterization for Multi Strong Triadic Closure, a related edge coloring
problem with applications in social network analysis. We provide further
results for Maximum Edge-Colorable Subgraph parameterized by the vertex
deletion distance to graphs where every component has order at most and for
the list-colored versions of both problems.Comment: 32 Page