Log In Sign Up

A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals

by   Yong Wang, et al.

In this paper, an iterative algorithm is designed to compute the sparse graphs for traveling salesman problem (TSP) according to the frequency quadrilaterals so that the computation time of the algorithms for TSP will be lowered. At each computation cycle, the algorithm first computes the average frequency f̅(e) of an edge e with N frequency quadrilaterals containing e in the input graph G(V,E). Then the 1/3|E| edges with low frequency are eliminated to generate the output graph with a smaller number of edges. The algorithm can be iterated several times and the original optimal Hamiltonian cycle is preserved with a high probability. The experiments demonstrate the algorithm computes the sparse graphs with the O(nlog_2n) edges containing the original optimal Hamiltonian cycle for most of the TSP instances in the TSPLIB. The computation time of the iterative algorithm is O(Nn^2).


page 1

page 2

page 3

page 4


Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle

In this paper we consider the following total functional problem: Given ...

Cycle Extendability of Hamiltonian Strongly Chordal Graphs

In 1990, Hendry conjectured that all Hamiltonian chordal graphs are cycl...

Perfect Edge-Transmitting Recombination of Permutations

Crossover is the process of recombining the genetic features of two pare...

The Gn,m Phase Transition is Not Hard for the Hamiltonian Cycle Problem

Using an improved backtrack algorithm with sophisticated pruning techniq...

Hidden Hamiltonian Cycle Recovery via Linear Programming

We introduce the problem of hidden Hamiltonian cycle recovery, where the...

A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in O(log n) Time

It is known for some time that a random graph G(n,p) contains w.h.p. a H...

Generalized Median Graph via Iterative Alternate Minimizations

Computing a graph prototype may constitute a core element for clustering...