Pages that link to "Item:Q2488237"
From MaRDI portal
The following pages link to Approximation algorithms for the Euclidean bipartite TSP (Q2488237):
Displaying 10 items.
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453) (← links)
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs (Q621695) (← links)
- On the structure and complexity of worst-case equilibria (Q883997) (← links)
- A note on the polytope of bipartite TSP (Q1682883) (← links)
- Polynomially solvable cases of the bipartite traveling salesman problem (Q1752819) (← links)
- On the bounded-hop MST problem on random Euclidean instances (Q2382669) (← links)
- Probabilistic analysis of bipartite traveling salesman problems (Q2741462) (← links)
- (Q2934580) (← links)
- A PTAS for Euclidean TSP with Hyperplane Neighborhoods (Q4987459) (← links)
- Euclidean TSP in narrow strips (Q6059948) (← links)