Pages that link to "Item:Q5891341"
From MaRDI portal
The following pages link to Minmax tree cover in the Euclidean space (Q5891341):
Displaying 9 items.
- Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767) (← links)
- New LP relaxations for minimum cycle/path/tree cover problems (Q2283007) (← links)
- Approximating the minmax rooted-tree cover in a tree (Q2380018) (← links)
- Better approximability results for min-max tree/cycle/path cover problems (Q2420656) (← links)
- Minmax subtree cover problem on cacti (Q2495907) (← links)
- Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems (Q3196380) (← links)
- How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover (Q3613779) (← links)
- Approximating bottleneck spanning trees on partitioned tuples of points (Q5881545) (← links)
- Minmax Tree Cover in the Euclidean Space (Q5901435) (← links)