1,398 research outputs found

    Approximation Algorithms for Generalized MST and TSP in Grid Clusters

    Full text link
    We consider a special case of the generalized minimum spanning tree problem (GMST) and the generalized travelling salesman problem (GTSP) where we are given a set of points inside the integer grid (in Euclidean plane) where each grid cell is 1×11 \times 1. In the MST version of the problem, the goal is to find a minimum tree that contains exactly one point from each non-empty grid cell (cluster). Similarly, in the TSP version of the problem, the goal is to find a minimum weight cycle containing one point from each non-empty grid cell. We give a (1+42+ϵ)(1+4\sqrt{2}+\epsilon) and (1.5+82+ϵ)(1.5+8\sqrt{2}+\epsilon)-approximation algorithm for these two problems in the described setting, respectively. Our motivation is based on the problem posed in [7] for a constant approximation algorithm. The authors designed a PTAS for the more special case of the GMST where non-empty cells are connected end dense enough. However, their algorithm heavily relies on this connectivity restriction and is unpractical. Our results develop the topic further

    A Systematic Review of Approximability Results for Traveling Salesman Problems leveraging the TSP-T3CO Definition Scheme

    Full text link
    The traveling salesman (or salesperson) problem, short TSP, is a problem of strong interest to many researchers from mathematics, economics, and computer science. Manifold TSP variants occur in nearly every scientific field and application domain: engineering, physics, biology, life sciences, and manufacturing just to name a few. Several thousand papers are published on theoretical research or application-oriented results each year. This paper provides the first systematic survey on the best currently known approximability and inapproximability results for well-known TSP variants such as the "standard" TSP, Path TSP, Bottleneck TSP, Maximum Scatter TSP, Generalized TSP, Clustered TSP, Traveling Purchaser Problem, Profitable Tour Problem, Quota TSP, Prize-Collecting TSP, Orienteering Problem, Time-dependent TSP, TSP with Time Windows, and the Orienteering Problem with Time Windows. The foundation of our survey is the definition scheme T3CO, which we propose as a uniform, easy-to-use and extensible means for the formal and precise definition of TSP variants. Applying T3CO to formally define the variant studied by a paper reveals subtle differences within the same named variant and also brings out the differences between the variants more clearly. We achieve the first comprehensive, concise, and compact representation of approximability results by using T3CO definitions. This makes it easier to understand the approximability landscape and the assumptions under which certain results hold. Open gaps become more evident and results can be compared more easily

    Network correlated data gathering with explicit communication: NP-completeness and algorithms

    Get PDF
    We consider the problem of correlated data gathering by a network with a sink node and a tree-based communication structure, where the goal is to minimize the total transmission cost of transporting the information collected by the nodes, to the sink node. For source coding of correlated data, we consider a joint entropy-based coding model with explicit communication where coding is simple and the transmission structure optimization is difficult. We first formulate the optimization problem definition in the general case and then we study further a network setting where the entropy conditioning at nodes does not depend on the amount of side information, but only on its availability. We prove that even in this simple case, the optimization problem is NP-hard. We propose some efficient, scalable, and distributed heuristic approximation algorithms for solving this problem and show by numerical simulations that the total transmission cost can be significantly improved over direct transmission or the shortest path tree. We also present an approximation algorithm that provides a tree transmission structure with total cost within a constant factor from the optimal

    Generalized partition crossover for the traveling salesman problem

    Get PDF
    2011 Spring.Includes bibliographical references.The Traveling Salesman Problem (TSP) is a well-studied combinatorial optimization problem with a wide spectrum of applications and theoretical value. We have designed a new recombination operator known as Generalized Partition Crossover (GPX) for the TSP. GPX is unique among other recombination operators for the TSP in that recombining two local optima produces new local optima with a high probability. Thus the operator can 'tunnel' between local optima without the need for intermediary solutions. The operator is respectful, meaning that any edges common between the two parent solutions are present in the offspring, and transmits alleles, meaning that offspring are comprised only of edges found in the parent solutions. We design a hybrid genetic algorithm, which uses local search in addition to recombination and selection, specifically for GPX. We show that this algorithm outperforms Chained Lin-Kernighan, a state-of-the-art approximation algorithm for the TSP. We next analyze these algorithms to determine why the algorithms are not capable of consistently finding a globally optimal solution. Our results reveal a search space structure which we call 'funnels' because they are analogous to the funnels found in continuous optimization. Funnels are clusters of tours in the search space that are separated from one another by a non-trivial distance. We find that funnels can trap Chained Lin-Kernighan, preventing the search from finding an optimal solution. Our data indicate that, under certain conditions, GPX can tunnel between funnels, explaining the higher frequency of optimal solutions produced by our hybrid genetic algorithm using GPX
    corecore