10 research outputs found

    Fixed-Parameter Algorithms for Rectilinear Steiner tree and Rectilinear Traveling Salesman Problem in the plane

    Full text link
    Given a set PP of nn points with their pairwise distances, the traveling salesman problem (TSP) asks for a shortest tour that visits each point exactly once. A TSP instance is rectilinear when the points lie in the plane and the distance considered between two points is the l1l_1 distance. In this paper, a fixed-parameter algorithm for the Rectilinear TSP is presented and relies on techniques for solving TSP on bounded-treewidth graphs. It proves that the problem can be solved in O(nh7h)O\left(nh7^h\right) where h≤nh \leq n denotes the number of horizontal lines containing the points of PP. The same technique can be directly applied to the problem of finding a shortest rectilinear Steiner tree that interconnects the points of PP providing a O(nh5h)O\left(nh5^h\right) time complexity. Both bounds improve over the best time bounds known for these problems.Comment: 24 pages, 13 figures, 6 table

    Summer 2010 Review

    Get PDF
    corecore