1,606 research outputs found

    An FPT Algorithm for Minimum Additive Spanner Problem

    Get PDF
    For a positive integer t and a graph G, an additive t-spanner of G is a spanning subgraph in which the distance between every pair of vertices is at most the original distance plus t. The Minimum Additive t-Spanner Problem is to find an additive t-spanner with the minimum number of edges in a given graph, which is known to be NP-hard. Since we need to care about global properties of graphs when we deal with additive t-spanners, the Minimum Additive t-Spanner Problem is hard to handle and hence only few results are known for it. In this paper, we study the Minimum Additive t-Spanner Problem from the viewpoint of parameterized complexity. We formulate a parameterized version of the problem in which the number of removed edges is regarded as a parameter, and give a fixed-parameter algorithm for it. We also extend our result to the case with both a multiplicative approximation factor ? and an additive approximation parameter ?, which we call (?, ?)-spanners

    A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs

    Get PDF
    AbstractIn this paper, we consider the problem of finding a maximum weight 2-matching containing no cycle of a length of at most three in a weighted simple graph, which we call the weighted triangle-free 2-matching problem. Although the polynomial solvability of this problem is still open in general graphs, a polynomial-time algorithm is given by Hartvigsen and Li for the problem in subcubic graphs, i.e., graphs with a maximum degree of at most three. Our contribution is to provide another polynomial-time algorithm for the weighted triangle-free 2-matching problem in subcubic graphs. Our algorithm consists of two basic algorithms: a steepest ascent algorithm and a classical maximum weight2-matching algorithm, and is justified by fundamental results from the theory of discrete convex functions on jump systems

    Improved Analysis of Highest-Degree Branching for Feedback Vertex Set

    Get PDF
    Recent empirical evaluations of exact algorithms for Feedback Vertex Set have demonstrated the efficiency of a highest-degree branching algorithm with a degree-based pruning heuristic. In this paper, we prove that this empirically fast algorithm runs in O(3.460^k n) time, where k is the solution size. This improves the previous best O(3.619^k n)-time deterministic algorithm obtained by Kociumaka and Pilipczuk (Inf. Process. Lett., 2014)