scientific article; zbMATH DE number 7525493
From MaRDI portal
Publication:5075801
DOI10.4230/LIPIcs.ESA.2019.56MaRDI QIDQ5075801
Arash Haddadan, Alantha Newman
Publication date: 11 May 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Matroid-based TSP rounding for half-integral solutions ⋮ A deterministic better-than-3/2 approximation algorithm for metric TSP ⋮ Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours
Cites Work
- Unnamed Item
- Unnamed Item
- Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices
- 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
- Analyzing the Held-Karp TSP bound: A monotonicity property with application
- On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems
- Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes
- Shorter tours and longer detours: uniform covers and a bit beyond
- The saleman's improved tours for fundamental classes
- Removing and Adding Edges for the Traveling Salesman Problem
- The traveling salesman problem in graphs with 3-edge cutsets
- Heuristic analysis, linear programming and branch and bound
- Matching, Euler tours and the Chinese postman
- 2-Matchings, the Traveling Salesman Problem, and the Subtour LP: A Proof of the Boyd-Carr Conjecture
- Integer Programming: Methods, Uses, Computations
- Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph
- Solution of a Large-Scale Traveling-Salesman Problem
- A Randomized Rounding Approach to the Traveling Salesman Problem
This page was built for publication:
