3,026 research outputs found

    Approximating the Regular Graphic TSP in near linear time

    Get PDF
    We present a randomized approximation algorithm for computing traveling salesperson tours in undirected regular graphs. Given an nn-vertex, kk-regular graph, the algorithm computes a tour of length at most (1+7lnkO(1))n\left(1+\frac{7}{\ln k-O(1)}\right)n, with high probability, in O(nklogk)O(nk \log k) time. This improves upon a recent result by Vishnoi (\cite{Vishnoi12}, FOCS 2012) for the same problem, in terms of both approximation factor, and running time. The key ingredient of our algorithm is a technique that uses edge-coloring algorithms to sample a cycle cover with O(n/logk)O(n/\log k) cycles with high probability, in near linear time. Additionally, we also give a deterministic 32+O(1k)\frac{3}{2}+O\left(\frac{1}{\sqrt{k}}\right) factor approximation algorithm running in time O(nk)O(nk).Comment: 12 page

    Approximating the minimum directed tree cover

    Full text link
    Given a directed graph GG with non negative cost on the arcs, a directed tree cover of GG is a rooted directed tree such that either head or tail (or both of them) of every arc in GG is touched by TT. The minimum directed tree cover problem (DTCP) is to find a directed tree cover of minimum cost. The problem is known to be NPNP-hard. In this paper, we show that the weighted Set Cover Problem (SCP) is a special case of DTCP. Hence, one can expect at best to approximate DTCP with the same ratio as for SCP. We show that this expectation can be satisfied in some way by designing a purely combinatorial approximation algorithm for the DTCP and proving that the approximation ratio of the algorithm is max{2,ln(D+)}\max\{2, \ln(D^+)\} with D+D^+ is the maximum outgoing degree of the nodes in GG.Comment: 13 page

    The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme

    Full text link
    The Traveling Salesman Problem (TSP) is among the most famous NP-hard optimization problems. We design for this problem a randomized polynomial-time algorithm that computes a (1+eps)-approximation to the optimal tour, for any fixed eps>0, in TSP instances that form an arbitrary metric space with bounded intrinsic dimension. The celebrated results of Arora (A-98) and Mitchell (M-99) prove that the above result holds in the special case of TSP in a fixed-dimensional Euclidean space. Thus, our algorithm demonstrates that the algorithmic tractability of metric TSP depends on the dimensionality of the space and not on its specific geometry. This result resolves a problem that has been open since the quasi-polynomial time algorithm of Talwar (T-04)

    Approximation Algorithms for Multi-Criteria Traveling Salesman Problems

    Full text link
    In multi-criteria optimization problems, several objective functions have to be optimized. Since the different objective functions are usually in conflict with each other, one cannot consider only one particular solution as the optimal solution. Instead, the aim is to compute a so-called Pareto curve of solutions. Since Pareto curves cannot be computed efficiently in general, we have to be content with approximations to them. We design a deterministic polynomial-time algorithm for multi-criteria g-metric STSP that computes (min{1 +g, 2g^2/(2g^2 -2g +1)} + eps)-approximate Pareto curves for all 1/2<=g<=1. In particular, we obtain a (2+eps)-approximation for multi-criteria metric STSP. We also present two randomized approximation algorithms for multi-criteria g-metric STSP that achieve approximation ratios of (2g^3 +2g^2)/(3g^2 -2g +1) + eps and (1 +g)/(1 +3g -4g^2) + eps, respectively. Moreover, we present randomized approximation algorithms for multi-criteria g-metric ATSP (ratio 1/2 + g^3/(1 -3g^2) + eps) for g < 1/sqrt(3)), STSP with weights 1 and 2 (ratio 4/3) and ATSP with weights 1 and 2 (ratio 3/2). To do this, we design randomized approximation schemes for multi-criteria cycle cover and graph factor problems.Comment: To appear in Algorithmica. A preliminary version has been presented at the 4th Workshop on Approximation and Online Algorithms (WAOA 2006

    Approximation Algorithms for the Asymmetric Traveling Salesman Problem : Describing two recent methods

    Full text link
    The paper provides a description of the two recent approximation algorithms for the Asymmetric Traveling Salesman Problem, giving the intuitive description of the works of Feige-Singh[1] and Asadpour et.al\ [2].\newline [1] improves the previous O(logn)O(\log n) approximation algorithm, by improving the constant from 0.84 to 0.66 and modifying the work of Kaplan et. al\ [3] and also shows an efficient reduction from ATSPP to ATSP. Combining both the results, they finally establish an approximation ratio of (43+ϵ)logn\left(\frac{4}{3}+\epsilon \right)\log n for ATSPP,\ considering a small ϵ>0\epsilon>0,\ improving the work of Chekuri and Pal.[4]\newline Asadpour et.al, in their seminal work\ [2], gives an O(lognloglogn)O\left(\frac{\log n}{\log \log n}\right) randomized algorithm for the ATSP, by symmetrizing and modifying the solution of the Held-Karp relaxation problem and then proving an exponential family distribution for probabilistically constructing a maximum entropy spanning tree from a spanning tree polytope and then finally defining the thin-ness property and transforming a thin spanning tree into an Eulerian walk.\ The optimization methods used in\ [2] are quite elegant and the approximation ratio could further be improved, by manipulating the thin-ness of the cuts.Comment: 12 page

    Counting Euler Tours in Undirected Bounded Treewidth Graphs

    Get PDF
    We show that counting Euler tours in undirected bounded tree-width graphs is tractable even in parallel - by proving a #SAC1\#SAC^1 upper bound. This is in stark contrast to #P-completeness of the same problem in general graphs. Our main technical contribution is to show how (an instance of) dynamic programming on bounded \emph{clique-width} graphs can be performed efficiently in parallel. Thus we show that the sequential result of Espelage, Gurski and Wanke for efficiently computing Hamiltonian paths in bounded clique-width graphs can be adapted in the parallel setting to count the number of Hamiltonian paths which in turn is a tool for counting the number of Euler tours in bounded tree-width graphs. Our technique also yields parallel algorithms for counting longest paths and bipartite perfect matchings in bounded-clique width graphs. While establishing that counting Euler tours in bounded tree-width graphs can be computed by non-uniform monotone arithmetic circuits of polynomial degree (which characterize #SAC1\#SAC^1) is relatively easy, establishing a uniform #SAC1\#SAC^1 bound needs a careful use of polynomial interpolation.Comment: 17 pages; There was an error in the proof of the GapL upper bound claimed in the previous version which has been subsequently remove

    On Approximating Multi-Criteria TSP

    Get PDF
    We present approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP). First, we devise randomized approximation algorithms for multi-criteria maximum traveling salesman problems (Max-TSP). For multi-criteria Max-STSP, where the edge weights have to be symmetric, we devise an algorithm with an approximation ratio of 2/3 - eps. For multi-criteria Max-ATSP, where the edge weights may be asymmetric, we present an algorithm with a ratio of 1/2 - eps. Our algorithms work for any fixed number k of objectives. Furthermore, we present a deterministic algorithm for bi-criteria Max-STSP that achieves an approximation ratio of 7/27. Finally, we present a randomized approximation algorithm for the asymmetric multi-criteria minimum TSP with triangle inequality Min-ATSP. This algorithm achieves a ratio of log n + eps.Comment: Preliminary version at STACS 2009. This paper is a revised full version, where some proofs are simplifie

    Dial a Ride from k-forest

    Full text link
    The k-forest problem is a common generalization of both the k-MST and the dense-kk-subgraph problems. Formally, given a metric space on nn vertices VV, with mm demand pairs V×V\subseteq V \times V and a ``target'' kmk\le m, the goal is to find a minimum cost subgraph that connects at least kk demand pairs. In this paper, we give an O(min{n,k})O(\min\{\sqrt{n},\sqrt{k}\})-approximation algorithm for kk-forest, improving on the previous best ratio of O(n2/3logn)O(n^{2/3}\log n) by Segev & Segev. We then apply our algorithm for k-forest to obtain approximation algorithms for several Dial-a-Ride problems. The basic Dial-a-Ride problem is the following: given an nn point metric space with mm objects each with its own source and destination, and a vehicle capable of carrying at most kk objects at any time, find the minimum length tour that uses this vehicle to move each object from its source to destination. We prove that an α\alpha-approximation algorithm for the kk-forest problem implies an O(αlog2n)O(\alpha\cdot\log^2n)-approximation algorithm for Dial-a-Ride. Using our results for kk-forest, we get an O(min{n,k}log2n)O(\min\{\sqrt{n},\sqrt{k}\}\cdot\log^2 n)- approximation algorithm for Dial-a-Ride. The only previous result known for Dial-a-Ride was an O(klogn)O(\sqrt{k}\log n)-approximation by Charikar & Raghavachari; our results give a different proof of a similar approximation guarantee--in fact, when the vehicle capacity kk is large, we give a slight improvement on their results.Comment: Preliminary version in Proc. European Symposium on Algorithms, 200
    corecore