An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure

@article{Xiao2015AnEA,
  title={An Exact Algorithm for TSP in Degree-3 Graphs Via Circuit Procedure and Amortization on Connectivity Structure},
  author={Mingyu Xiao and Hiroshi Nagamochi},
  journal={Algorithmica},
  year={2015},
  volume={74},
  pages={713-741}
}
The paper presents an $$O^*(1.2312^n)$$O∗(1.2312n)-time and polynomial-space algorithm for the traveling salesman problem in an $$n$$n-vertex graph with maximum degree 3. This improves all previous time bounds of polynomial-space algorithms for this problem. Our algorithm is a simple branch-and-search algorithm with only one branch rule designed on a cut-circuit structure of a graph induced by unprocessed edges. To improve a time bound by a simple analysis on measure and conquer, we introduce… 

A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs

This paper presents the first polynomial-space exact algorithm specialized for the TSP in graphs with degree at most 6. We develop a set of branching rules to aid the analysis of the branching

A POLYNOMIAL-SPACE EXACT ALGORITHM FOR TSP IN DEGREE-5 GRAPHS

TLDR
This work presents a polynomial-space branching algorithm for the TSP in graphs with degree at most 5, and shows that it has a running time of O (2.4723 n ), which is the first exact algorithm specialized to graphs of such high degree.

An Improved-time Polynomial-space Exact Algorithm for TSP in Degree-5 Graphs

TLDR
A polynomial-space branching algorithm for the TSP in an n-vertex graph with degree at most 5 is presented, and it is shown that it has a running time of O∗(2.3500n), which improves the previous best known time bound of O ∗( 2.4723n) given by the authors.

An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4

The paper presents a 1.692nnO(1)-time polynomial-space algorithm for the traveling salesman problem in an n-vertex edge-weighted graph with maximum degree 4, which improves the previous results of

The Asymmetric Travelling Salesman Problem in Sparse Digraphs

TLDR
Two new deterministic algorithms for ATSP are presented: the first running in time $O(2^{0.441(d-1)n})$ and polynomial space, and the second in exponential space with running time of $O^*(\tau(d)^{n/2})$ for a function $\t Tau(d)\le d$.

An iterative algorithm to eliminate edges for traveling salesman problem based on a new binomial distribution

TLDR
A previous probability model for the optimal Hamiltonian cycle edges according to the frequency quadrilaterals in Kn$K_{n}$ is updated to show the probability that an edge e has the frequency 5 in a frequency quadrilateral.

Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle

TLDR
A linear-time algorithm computing a second cycle with length at least $n - 4\alpha (\sqrt{n}+2\alpha)+8$ where $\alpha = \frac{\Delta-2}{\delta-2}$ and $\delta,\Delta$ are the minimum and the maximum degree of the graph, respectively is provided.

Wang An Improved Method to Compute Sparse Graphs for Traveling Salesman Problem

  • Computer Science
  • 2018
TLDR
An improved iterative algorithm to compute the sparse graphs for TSP by frequency graphs computed with frequency quadrilaterals is presented, enhanced by adjusting two parameters of the algorithm.

An Improved Method to Compute Sparse Graphs for Traveling Salesman Problem

TLDR
An improved iterative algorithm to compute the sparse graphs for TSP by frequency graphs computed with frequency quadrilaterals is presented, enhanced by adjusting two parameters of the algorithm.

A Heuristic Algorithm to Compute a Subgraph for TSP Based on Frequency Quadrilaterals

TLDR
A heuristic algorithm was presented to compute certain subgraphs for symmetric traveling salesman problem using frequency quadrilaterals and illustrated that in certain instances for Euclidean TSP with scale above 1000, the number of edges in complete graph is reduced by more than 30 times.

References

SHOWING 1-10 OF 23 REFERENCES

Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions

TLDR
The approach is based on geometric properties of planar branch decompositions obtained by Seymour and Thomas, combined with refined techniques of dynamic programming on planar graphs based on properties of non-crossing partitions to design fast subexponential exact and parameterized algorithms onPlanar graphs.

Determinant Sums for Undirected Hamiltonicity

  • Andreas Björklund
  • Computer Science, Mathematics
    2010 IEEE 51st Annual Symposium on Foundations of Computer Science
  • 2010
TLDR
A Monte Carlo algorithm for Hamilton city detection in an $n$-vertex undirected graph running in $O*(1.657^{n})$ time is presented, which is the first super polynomial improvement on the worst case runtime for the problem since the O^*(2^n) bound established for TSP almost fifty years ago.

An Improved Exact Algorithm for TSP in Degree-4 Graphs

The paper presents an O *(1.716 n )-time polynomial-space algorithm for the traveling salesman problem in an n-vertex edge-weighted graph with maximum degree 4, which improves the previous results of

A new upper bound for the traveling salesman problem in cubic graphs

The Traveling Salesman Problem for Cubic Graphs

  • D. Eppstein
  • Computer Science, Mathematics
    J. Graph Algorithms Appl.
  • 2007
TLDR
The algorithm can find the minimum weight Hamiltonian cycle (traveling salesman problem), in the same time bound, and count the number of Hamiltonian cycles in time \(\mathcal{O}(2^{3n/8}n^{\mathcal O}(1)}) \approx {\rm 1.29684}^n\).

Finding and enumerating Hamilton cycles in 4-regular graphs

The Travelling Salesman Problem in Bounded Degree Graphs

We show that the travelling salesman problem in bounded-degreegraphs can be solved in time $O\bigl((2-\epsilon)^n\bigr)$, wheree> 0 depends only on the degree bound but noton the number of cities, n.

Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth

TLDR
Two new approaches rooted in linear algebra, based on matrix rank and determinants, which provide deterministic c tw | V | O ( 1 ) time algorithms, also for weighted and counting versions of connectivity problems are presented.

The traveling salesman problem in bounded degree graphs

We show that the traveling salesman problem in bounded-degree graphs can be solved in time <i>O</i>((2-ε)<i><sup>n</sup></i>), where ε > 0 depends only on the degree bound but not on the number of

Measure and Conquer: Domination - A Case Study

TLDR
Davis-Putnam-style exponential-time backtracking algorithms are the most common algorithms used for finding exact solutions of NP-hard problems; the running time of these algorithms is largely overestimated because of a “bad” choice of the measure.