Pages that link to "Item:Q5494987"
From MaRDI portal
The following pages link to Approximating Graphic TSP by Matchings (Q5494987):
Displayed 31 items.
- A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges (Q298954) (← 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)
- 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)
- Simple cubic graphs with no short traveling salesman tour (Q1752607) (← links)
- Improved integrality gap upper bounds for traveling salesperson problems with distances one and two (Q1754106) (← links)
- Constant factor approximation for ATSP with two edge weights (Q1801010) (← links)
- Approximating TSP walks in subcubic graphs (Q2101165) (← links)
- Weighted amplifiers and inapproximability results for travelling salesman problem (Q2156301) (← links)
- \(\frac{13}{9}\)-approximation for graphic TSP (Q2254507) (← links)
- On the minimum leaf number of cubic graphs (Q2324488) (← 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)
- A 4/3-approximation for TSP on cubic 3-edge-connected graphs (Q2417175) (← links)
- An LP-based \(\frac{3}{2}\)-approximation algorithm for the \(s-t\) path graph traveling salesman problem (Q2450741) (← 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)
- Reassembling Trees for the Traveling Salesman (Q2806177) (← links)
- Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies (Q2947865) (← links)
- Constant Factor Approximation for ATSP with Two Edge Weights (Q3186505) (← links)
- Improved Approximations for Cubic Bipartite and Cubic TSP (Q3186507) (← links)
- (Q3191144) (← links)
- Approximation hardness of graphic TSP on cubic graphs (Q3194690) (← links)
- Special Frequency Quadrilaterals and an Application (Q3305469) (← links)
- Cubic TSP: A 1.3-Approximation (Q4581212) (← links)
- TSP Tours in Cubic Graphs: Beyond 4/3 (Q5254089) (← links)
- (Q5743492) (← links)
- A deterministic better-than-3/2 approximation algorithm for metric TSP (Q6086006) (← links)