Pages that link to "Item:Q4880877"

The following pages link to Two Algorithmic Results for the Traveling Salesman Problem (Q4880877):

Displaying 38 items.

• Rank functions of tropical matrices (Q269280) (← links)
• Computing the permanent of (some) complex matrices (Q285430) (← links)
• An approximation algorithm for the maximum traveling salesman problem (Q293334) (← links)
• The expected characteristic and permanental polynomials of the random Gram matrix (Q405292) (← links)
• The factorization of the permanent of a matrix with minimal rank in prime characteristic (Q663475) (← links)
• Tropical lower bounds for extended formulations (Q745680) (← links)
• A quantization framework for smoothed analysis of Euclidean optimization problems (Q893320) (← links)
• An efficient tree decomposition method for permanents and mixed discriminants (Q905704) (← links)
• On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries (Q962158) (← links)
• Measure concentration in optimization (Q1365046) (← links)
• An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices (Q1602709) (← links)
• Geometric versions of the three-dimensional assignment problem under general norms (Q1751127) (← links)
• Factoring a band matrix over a semiring (Q2041261) (← links)
• Univariate ideal membership parameterized by rank, degree, and number of generators (Q2075388) (← links)
• Efficient computation of permanents, with applications to boson sampling and random matrices (Q2133747) (← links)
• An extended tree-width notion for directed graphs related to the computation of permanents (Q2254501) (← links)
• On hard instances of non-commutative permanent (Q2306589) (← links)
• A hybrid algorithm for multi-homogeneous Bézout number (Q2383696) (← links)
• The complexity of tropical matrix factorization (Q2445938) (← links)
• Detecting matrices of combinatorial rank three (Q2452428) (← links)
• On Hard Instances of Non-Commutative Permanent (Q2817859) (← links)
• Expressing Polynomials as the Permanent of low rank Square Matrices (Q2883553) (← links)
• An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents (Q3007631) (← links)
• Tropical lower bound for extended formulations. II. Deficiency graphs of matrices (Q3120460) (← links)
• The permanental process (Q3417907) (← links)
• On finding a cyclic tour and a vehicle loading plan yielding maximum profit (Q4242569) (← links)
• Approximating permanents and hafnians (Q4645007) (← links)
• Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor (Q4705350) (← links)
• On the classical complexity of sampling from quantum interference of indistinguishable bosons (Q4985083) (← links)
• A Determinantal Identity for the Permanent of a Rank 2 Matrix (Q5053831) (← links)
• (Q5090939) (← links)
• THE MAXIMUM TRAVELING SALESMAN PROBLEM ON BANDED MATRICES (Q5249292) (← links)
• Tropical semimodules of dimension two (Q5254696) (← links)
• On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices (Q5387751) (← links)
• Algorithms – ESA 2004 (Q5464598) (← links)
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
• Inapproximability of positive semidefinite permanents and quantum state tomography (Q6088302) (← links)
• How I got to like graph polynomials (Q6593617) (← links)