The following pages link to Better approximations for max TSP (Q1607064):
Displayed 17 items.
- 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)
- Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph (Q499338) (← links)
- 35/44-approximation for asymmetric maximum TSP with triangle inequality (Q627544) (← links)
- On the maximum TSP with \(\gamma\)-parameterized triangle inequality (Q691373) (← links)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
- A better differential approximation ratio for symmetric TSP (Q924134) (← links)
- Approximation algorithms for maximum latency and partial cycle cover (Q1015324) (← links)
- Improved deterministic approximation algorithms for max TSP (Q1041779) (← links)
- Approximating the maximum quadratic assignment problem (Q1607075) (← links)
- Approximation algorithms for some vehicle routing problems (Q1765372) (← links)
- A \(\frac78\)-approximation algorithm for metric Max TSP (Q1847381) (← links)
- Informative path planning as a maximum traveling salesman problem with submodular rewards (Q2345604) (← links)
- Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems (Q2446858) (← links)
- An approximation algorithm for maximum triangle packing (Q2492197) (← links)
- An improved randomized approximation algorithm for Max TSP (Q2576776) (← links)
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings (Q2867103) (← links)