Pages that link to "Item:Q1041779"
From MaRDI portal
The following pages link to Improved deterministic approximation algorithms for max TSP (Q1041779):
Displaying 34 items.
- An improved exact algorithm for TSP in graphs of maximum degree 4 (Q255262) (← links)
- An approximation algorithm for the maximum traveling salesman problem (Q293334) (← links)
- Differential approximation results for the traveling salesman and related problems (Q294874) (← links)
- An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem (Q387104) (← links)
- A 0.5358-approximation for Bandpass-2 (Q498435) (← 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)
- A better differential approximation ratio for symmetric TSP (Q924134) (← links)
- An improved approximation algorithm for the maximum TSP (Q974748) (← links)
- Minimum-weight cycle covers and their approximability (Q1028118) (← links)
- Deterministic 7/8-approximation for the metric maximum TSP (Q1034619) (← links)
- Reoptimization of minimum and maximum traveling salesman's tours (Q1044031) (← links)
- Maximizing traveling salesman problem for special matrices (Q1343160) (← links)
- Better approximations for max TSP (Q1607064) (← links)
- The approximation ratio of the greedy algorithm for the metric traveling salesman problem (Q1785355) (← links)
- Single approximation for the biobjective Max TSP (Q1951558) (← links)
- Approximation of the double traveling salesman problem with multiple stacks (Q2034797) (← links)
- Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension (Q2162693) (← links)
- Improving the robustness of EPS to solve the TSP (Q2170194) (← links)
- Improved deterministic strategy for the Canadian Traveller Problem exploiting small max-\((s,t)\)-cuts (Q2193076) (← links)
- Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP (Q2434738) (← links)
- Priority functions for the approximation of the metric TSP (Q2444775) (← links)
- Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems (Q2446858) (← links)
- Improved approximation algorithms for metric MaxTSP (Q2467566) (← links)
- An improved randomized approximation algorithm for Max TSP (Q2576776) (← links)
- \(z\)-approximations (Q2775899) (← links)
- Approximability of the multiple stack TSP (Q2861493) (← links)
- Simpler approximation of the maximum asymmetric traveling salesman problem (Q2904788) (← links)
- Minimum-Weight Cycle Covers and Their Approximability (Q3508566) (← links)
- Approximating Multi-criteria Max-TSP (Q3541086) (← links)
- Deterministic 7/8-Approximation for the Metric Maximum TSP (Q3541791) (← links)
- An improved approximation algorithm for ATSP (Q5144891) (← links)
- Approximating the regular graphic TSP in near linear time (Q5275362) (← links)