Pages that link to "Item:Q1827840"
From MaRDI portal
The following pages link to A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree (Q1827840):
Displaying 15 items.
- Approximation results for a min-max location-routing problem (Q765374) (← links)
- Locating and repairing faults in a network with mobile agents (Q962168) (← links)
- A note on the minimum bounded edge-partition of a tree (Q967344) (← links)
- \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective (Q1363767) (← 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)
- An overview of graph covering and partitioning (Q2142633) (← links)
- On optimal coverage of a tree with multiple robots (Q2184041) (← links)
- Minmax subtree cover problem on cacti (Q2495907) (← links)
- Exact and approximation algorithms for the min-max \(k\)-traveling salesmen problem on a tree (Q2509522) (← links)
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover (Q2699031) (← links)
- Approximation results for min-max path cover problems in vehicle routing (Q3065634) (← links)
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen (Q4210146) (← links)
- Approximating bottleneck spanning trees on partitioned tuples of points (Q5881545) (← links)
- Minmax Tree Cover in the Euclidean Space (Q5901435) (← links)
