The following pages link to Better approximations for max TSP (Q1607064):
Displaying 32 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)
- Parameterized and approximation algorithms for finding two disjoint matchings (Q300238) (← 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)
- 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)
- On the maximum betweenness improvement problem (Q737099) (← links)
- Maximum travelling salesman problem. I (Q891481) (← 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)
- On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem (Q1078097) (← links)
- Approximating the maximum quadratic assignment problem (Q1607075) (← links)
- On global integer extrema of real-valued box-constrained multivariate quadratic functions (Q1680502) (← 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)
- Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP (Q2434738) (← 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)
- \(z\)-approximations (Q2775899) (← links)
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings (Q2867103) (← links)
- Approximating Multi-criteria Max-TSP (Q3541086) (← links)
- Maximum Scatter TSP in Doubling Metrics (Q4575744) (← links)
- A Polynomial 3/5-Approximate Algorithm for the Asymmetric Maximization Version of the 3-PSP (Q4973249) (← links)
- A polynomial algorithm with asymptotic ratio $2/3$ for the asymmetric maximization version of the $m$-PSP (Q5090157) (← links)
- Temporal Traveling Salesman Problem – in a Logic- and Graph Theory-Based Depiction (Q5881167) (← links)
- Order-sensitive competitive revenue maximization for viral marketing in social networks (Q6658985) (← links)
