Pages that link to "Item:Q974748"
From MaRDI portal
The following pages link to An improved approximation algorithm for the maximum TSP (Q974748):
Displaying 17 items.
- An improved exact algorithm for TSP in graphs of maximum degree 4 (Q255262) (← links)
- On the maximum TSP with \(\gamma\)-parameterized triangle inequality (Q691373) (← links)
- Deterministic algorithms for multi-criteria max-TSP (Q713324) (← links)
- On the maximum betweenness improvement problem (Q737099) (← links)
- Deterministic 7/8-approximation for the metric maximum TSP (Q1034619) (← links)
- Improving the robustness of EPS to solve the TSP (Q2170194) (← links)
- Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP (Q2434738) (← links)
- (Q3170345) (← links)
- An improved approximation algorithm for the ATSP with parameterized triangle inequality (Q3497512) (← links)
- Approximating Multi-criteria Max-TSP (Q3541086) (← links)
- Maximum Scatter TSP in Doubling Metrics (Q4575744) (← links)
- Improved Approximation Lower Bounds for TSP with Distances One and Two (Q4784456) (← links)
- Improving TSP Tours Using Dynamic Programming over Tree Decompositions (Q4973050) (← links)
- An improved approximation algorithm for ATSP (Q5144891) (← links)
- An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs (Q5220466) (← links)
- Approximating TSP Solution by MST Based Graph Pyramid (Q5325746) (← links)
- THE TSP AND THE SUM OF ITS MARGINAL VALUES (Q5485789) (← links)
