Pages that link to "Item:Q1026101"
From MaRDI portal
The following pages link to Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2 (Q1026101):
Displaying 15 items.
- Approximability of the minimum-weight \(k\)-size cycle cover problem (Q330503) (← links)
- Fast algorithm to find 2-factor of minimum weight (Q334255) (← links)
- A polynomial-time approximation scheme for the Euclidean problem on a cycle cover of a graph (Q492282) (← links)
- Approximability of the problem about a minimum-weight cycle cover of a graph (Q492748) (← 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)
- On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space (Q643801) (← links)
- \(7/5\)-approximation algorithm for 2-PSP on minimum with different weight functions (Q890881) (← links)
- On the generalized 2-peripatetic salesman problem (Q1328613) (← links)
- Exact algorithms for the equitable traveling salesman problem (Q1753595) (← links)
- Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem (Q2238214) (← links)
- The undirected \(m\)-capacitated peripatetic salesman problem (Q2253380) (← links)
- Approximating the metric 2-peripatetic salesman problem (Q2867374) (← links)
- (Q3115273) (← links)
- Safe and secure vehicle routing: a survey on minimization of risk exposure (Q6056884) (← links)
