Pages that link to "Item:Q1034619"
From MaRDI portal
The following pages link to Deterministic 7/8-approximation for the metric maximum TSP (Q1034619):
Displaying 13 items.
- An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem (Q387104) (← links)
- Approximating the metric TSP in linear time (Q649110) (← links)
- On the maximum TSP with \(\gamma\)-parameterized triangle inequality (Q691373) (← links)
- An improved approximation algorithm for the maximum TSP (Q974748) (← links)
- Improved deterministic approximation algorithms for max TSP (Q1041779) (← links)
- A \(\frac78\)-approximation algorithm for metric Max TSP (Q1847381) (← 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)
- Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems (Q2446858) (← links)
- Truthful Mechanisms for Matching and Clustering in an Ordinal World (Q2959835) (← links)
- Deterministic 7/8-Approximation for the Metric Maximum TSP (Q3541791) (← links)
- Approximation algorithms for the maximum-weight cycle/path packing problems (Q6542868) (← links)
- Improved approximation algorithms for cycle and path packings (Q6575393) (← links)