The following pages link to Min-max tree covers of graphs. (Q703232):
Displayed 6 items.
- Approximation hardness of min-max tree covers (Q974986) (← links)
- Distributed boundary coverage with a team of networked miniature robots using a robust market-based algorithm (Q1022474) (← links)
- Multiple UAV exploration of an unknown region (Q1022476) (← links)
- Approximating the minmax rooted-tree cover in a tree (Q2380018) (← links)
- Covering Directed Graphs by In-Trees (Q3511356) (← links)
- Minmax Tree Cover in the Euclidean Space (Q5901435) (← links)