APPROXIMATING THE TREE AND TOUR COVERS OF A GRAPH Esther
نویسنده
چکیده
The tree and tour cover problems on an edge-weighted graph are to compute a minimum weight tree and closed walk, respectively, whose vertices form a vertex cover. Both problems are NP-hard. In this note we give strongly polynomial time, constant factor approximation algorithms for both problems. An interesting feature of our algorithms is how they combine approximations of other problems, namely the weighted vertex cover, traveling salesman, and Steiner tree problems. y Partially supported by NSF Grants CCR-9204585 and ECSE-8857642.
منابع مشابه
Approximating the Tree and Tour Covers of a Graph
The tree and tour cover problems on an edge-weighted graph are to compute a minimum weight tree and closed walk, respectively, whose vertices form a vertex cover. Both problems are NP-hard. In this note we give strongly polynomial time, constant factor approximation algorithms for both problems. An interesting feature of our algorithms is how they combine approximations of other problems, namel...
متن کاملApproximation algorithms for metric tree cover and generalized tour and tree covers
Given a weighted undirected graph G = (V, E), a tree (respectively tour) cover of an edge-weighted graph is a set of edges which forms a tree (resp. closed walk) and covers every other edge in the graph. The tree (resp. tour) cover problem is of finding a minimum weight tree (resp. tour) cover of G. Arkin, Halldórsson and Hassin (1993) give approximation algorithms with factors respectively 3.5...
متن کاملGraph-TSP from Steiner Cycles
We present an approach for the traveling salesman problem with graph metric based on Steiner cycles. A Steiner cycle is a cycle that is required to contain some specified subset of vertices. For a graph G, if we can find a spanning tree T and a simple cycle that contains the vertices with odd-degree in T , then we show how to combine the classic “double spanning tree” algorithm with Christofide...
متن کاملApproximating TSP Solution by MST Based Graph Pyramid
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of cities, the problem is approximated into a simpler form containing smaller number of cities, which is then solved optimally. Graph pyramid solution strategies, in a bottom-up manner using Bor̊uvka’s minimum spanning tree...
متن کاملPrize-Collecting TSP with a Budget Constraint
We consider constrained versions of the prize-collecting traveling salesman and the minimum spanning tree problems. The goal is to maximize the number of vertices in the returned tour/tree subject to a bound on the tour/tree cost. We present a 2-approximation algorithm for these problems based on a primal-dual approach. The algorithm relies on finding a threshold value for the dual variable cor...
متن کامل