Pages that link to "Item:Q1838426"
From MaRDI portal
The following pages link to An extension of Christofides heuristic to the k-person travelling salesman problem (Q1838426):
Displayed 5 items.
- Approximation algorithms for multiple terminal, Hamiltonian path problems (Q691412) (← links)
- Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem (Q3936521) (← links)
- Approximation algorithms for the restricted \(k\)-Chinese postman problems with penalties (Q6181377) (← links)