Quantum speedup of the Travelling Salesman Problem for bounded-degree graphs
نویسندگان
چکیده
Dominic J. Moylett, 2, 3, ∗ Noah Linden, † and Ashley Montanaro ‡ Quantum Engineering Technology Labs, H. H. Wills Physics Laboratory and Department of Electrical & Electronic Engineering, University of Bristol, BS8 1FD, UK Quantum Engineering Centre for Doctoral Training, H. H. Wills Physics Laboratory and Department of Electrical & Electronic Engineering, University of Bristol, BS8 1FD, UK Heilbronn Institute for Mathematical Research, University of Bristol, BS8 1SN, UK School of Mathematics, University of Bristol, BS8 1TW, UK (Dated: December 18, 2016)
منابع مشابه
A CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملA hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملFast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus
We give a general technique for designing fast subexponential algorithms for several graph problems whose instances are restricted to graphs of bounded genus. We use it to obtain time 2 √ n) algorithms for a wide family of problems such as Hamiltonian Cycle, Σ-embedded Graph Travelling Salesman Problem, Longest Cycle, and Max Leaf Tree. For our results, we combine planarizing techniques with dy...
متن کاملLight Spanners in Bounded Pathwidth Graphs
In approximation algorithm design, light spanners has applications in graph-metric problems such as metric TSP (the traveling salesman problem) [8] and others [3]. We have developed an efficient algorithm in [9] for light spanners in bounded pathwidth graphs, based on an intermediate data structure called monotone tree. In this paper, we extended the results to include bounded catwidth graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1612.06203 شماره
صفحات -
تاریخ انتشار 2016