Pages that link to "Item:Q5264766"
From MaRDI portal
The following pages link to A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem (Q5264766):
Displaying 5 items.
- Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph (Q499338) (← links)
- (Q3115273) (← 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)
- Approximation algorithms for 2-PSP-2W-max and 2-CC-2W-max (Q6587426) (← links)