Pages that link to "Item:Q2509522"
From MaRDI portal
The following pages link to Exact and approximation algorithms for the min-max \(k\)-traveling salesmen problem on a tree (Q2509522):
Displaying 10 items.
- Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
- The multiple traveling salesman problem on spiders (Q831830) (← links)
- \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective (Q1363767) (← links)
- A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree (Q1827840) (← links)
- Minmax \(p\)-traveling salesmen location problems on a tree (Q1872012) (← links)
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree (Q1917344) (← links)
- Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints (Q2169436) (← links)
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover (Q2699031) (← links)
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen (Q4210146) (← links)
- Minisum multipurpose trip location problem on trees (Q4639691) (← links)
