scientific article; zbMATH DE number 7525493
From MaRDI portal
Publication:5075801
DOI10.4230/LIPICS.ESA.2019.56MaRDI QIDQ5075801FDOQ5075801
Authors: Arash Haddadan, Alantha Newman 
Publication date: 11 May 2022
Title of this publication is not available (Why is that?)
Cites Work
- Matching, Euler tours and the Chinese postman
- Solution of a Large-Scale Traveling-Salesman Problem
- The traveling salesman problem in graphs with 3-edge cutsets
- 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
- Integer Programming: Methods, Uses, Computations
- A Randomized Rounding Approach to the Traveling Salesman Problem
- On the Held-Karp relaxation for the asymmetric and symmetric traveling salesman problems
- Title not available (Why is that?)
- Heuristic analysis, linear programming and branch and bound
- Analyzing the Held-Karp TSP bound: A monotonicity property with application
- Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices
- Title not available (Why is that?)
- 2-matchings, the traveling salesman problem, and the subtour LP: a proof of the Boyd-Carr conjecture
- Removing and Adding Edges for the Traveling Salesman Problem
- Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes
- Shorter tours and longer detours: uniform covers and a bit beyond
- Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph
- The saleman's improved tours for fundamental classes
Cited In (4)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075801)
