Two Algorithmic Results for the Traveling Salesman Problem
From MaRDI portal
Publication:4880877
Recommendations
Cited in
(42)- Measure concentration in optimization
- An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices
- Geometric versions of the three-dimensional assignment problem under general norms
- Factoring a band matrix over a semiring
- Univariate ideal membership parameterized by rank, degree, and number of generators
- Efficient computation of permanents, with applications to boson sampling and random matrices
- An extended tree-width notion for directed graphs related to the computation of permanents
- On hard instances of non-commutative permanent
- A hybrid algorithm for multi-homogeneous Bézout number
- The complexity of tropical matrix factorization
- Detecting matrices of combinatorial rank three
- Rank functions of tropical matrices
- On hard instances of non-commutative permanent
- Computing the permanent of (some) complex matrices
- Expressing polynomials as the permanent of low rank square matrices
- An approximation algorithm for the maximum traveling salesman problem
- An extended tree-width notion for directed graphs related to the computation of permanents
- An algorithm for the solution of the two-route Johnson problem
- Tropical lower bound for extended formulations. II: Deficiency graphs of matrices
- The permanental process
- The expected characteristic and permanental polynomials of the random Gram matrix
- On finding a cyclic tour and a vehicle loading plan yielding maximum profit
- Approximating permanents and hafnians
- Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
- On the classical complexity of sampling from quantum interference of indistinguishable bosons
- A determinantal identity for the permanent of a rank 2 matrix
- Univariate ideal membership parameterized by rank, degree, and number of generators
- THE MAXIMUM TRAVELING SALESMAN PROBLEM ON BANDED MATRICES
- Tropical semimodules of dimension two
- On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
- Algorithms – ESA 2004
- A diagonal completion and 2-optimal procedure for the travelling salesman problem
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
- Inapproximability of positive semidefinite permanents and quantum state tomography
- How I got to like graph polynomials
- The factorization of the permanent of a matrix with minimal rank in prime characteristic
- An asymptotically fast polynomial space algorithm for Hamiltonicity detection in sparse directed graphs
- Parameterized applications of symbolic differentiation of (totally) multilinear polynomials
- Tropical lower bounds for extended formulations
- A quantization framework for smoothed analysis of Euclidean optimization problems
- An efficient tree decomposition method for permanents and mixed discriminants
- On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
This page was built for publication: Two Algorithmic Results for the Traveling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4880877)
