Pages that link to "Item:Q5494986"
From MaRDI portal
The following pages link to A Randomized Rounding Approach to the Traveling Salesman Problem (Q5494986):
Displayed 50 items.
- Traveling salesman problems in temporal graphs (Q284573) (← links)
- A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs (Q298977) (← links)
- The Steiner traveling salesman problem with online edge blockages (Q319009) (← links)
- The minimum spanning tree problem with non-terminal set (Q456089) (← links)
- Spanning closed walks and TSP in 3-connected planar graphs (Q462924) (← links)
- Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs (Q484552) (← links)
- New inapproximability bounds for TSP (Q494069) (← links)
- Better \(s-t\)-tours by Gao trees (Q1800996) (← links)
- Constant factor approximation for ATSP with two edge weights (Q1801010) (← links)
- Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids (Q2059021) (← links)
- Approximating TSP walks in subcubic graphs (Q2101165) (← links)
- Paving property for real stable polynomials and strongly Rayleigh processes (Q2137014) (← links)
- A LP-based approximation algorithm for generalized traveling salesperson path problem (Q2150585) (← links)
- Weighted amplifiers and inapproximability results for travelling salesman problem (Q2156301) (← links)
- Matroid-based TSP rounding for half-integral solutions (Q2164710) (← links)
- Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
- The salesman's improved tours for fundamental classes (Q2227538) (← links)
- The stable marriage problem: an interdisciplinary review from the physicist's perspective (Q2231919) (← links)
- \(\frac{13}{9}\)-approximation for graphic TSP (Q2254507) (← links)
- On the integrality gap of the subtour LP for the 1,2-TSP (Q2340281) (← links)
- Approximating minimum-cost connected \(T\)-joins (Q2345942) (← links)
- An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality (Q2353642) (← links)
- An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem (Q2408163) (← links)
- The traveling salesman problem on cubic and subcubic graphs (Q2452378) (← links)
- An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph (Q2656340) (← links)
- An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
- The Poisson binomial distribution -- old \& new (Q2684692) (← links)
- Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours (Q2687058) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Reassembling Trees for the Traveling Salesman (Q2806177) (← links)
- Nonoblivious 2-Opt heuristics for the traveling salesman problem (Q2811309) (← links)
- TSP on Cubic and Subcubic Graphs (Q3009751) (← links)
- Better s-t-Tours by Gao Trees (Q3186497) (← links)
- Constant Factor Approximation for ATSP with Two Edge Weights (Q3186505) (← links)
- Approximation hardness of graphic TSP on cubic graphs (Q3194690) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective (Q3464477) (← links)
- The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem (Q4577740) (← links)
- (Q4638054) (← links)
- Random Walks in Polytopes and Negative Dependence (Q4638105) (← links)
- (Q5075801) (← links)
- Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design (Q5085119) (← links)
- Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem (Q5206234) (← links)
- Generalized maximum entropy estimation (Q5214230) (← links)
- An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs (Q5220466) (← links)
- TSP Tours in Cubic Graphs: Beyond 4/3 (Q5254089) (← links)
- (Q5743492) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup> (Q5856438) (← links)
- Reducing Path TSP to TSP (Q5860476) (← links)
- An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem (Q5863328) (← links)
- The temporal explorer who returns to the base (Q5918316) (← links)