Pages that link to "Item:Q2380018"
From MaRDI portal
The following pages link to Approximating the minmax rooted-tree cover in a tree (Q2380018):
Displaying 11 items.
- Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767) (← links)
- Covering directed graphs by in-trees (Q626455) (← links)
- Approximation results for a min-max location-routing problem (Q765374) (← links)
- Min-max cover of a graph with a small number of parts (Q1751107) (← links)
- On optimal coverage of a tree with multiple robots (Q2184041) (← links)
- Online graph exploration algorithms for cycles and trees by multiple searchers (Q2251142) (← links)
- Approximation results for min-max path cover problems in vehicle routing (Q3065634) (← links)
- Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems (Q3196380) (← links)
- Covering Directed Graphs by In-Trees (Q3511356) (← links)
- Minmax Tree Cover in the Euclidean Space (Q5901435) (← links)
- (Q6084420) (← links)
