The following pages link to (Q3115591):
Displaying 10 items.
- Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space (Q735647) (← links)
- Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP (Q2434738) (← links)
- (1,2)-Hamiltonian completion on a matching (Q2841988) (← links)
- A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs (Q4242916) (← links)
- Heavy cycles in weighted graphs (Q4786785) (← 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)
- An asymptotically optimal algorithm for the m-Peripatetic Salesman Problem on random inputs with discrete distribution (Q5374000) (← links)
- A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem (Q5443376) (← links)
- Approximation algorithms for 2-PSP-2W-max and 2-CC-2W-max (Q6587426) (← links)
