Pages that link to "Item:Q3088103"
From MaRDI portal
The following pages link to Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems (Q3088103):
Displaying 6 items.
- Approximating the minmax rooted-tree cover in a tree (Q2380018) (← links)
- How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover (Q3613779) (← links)
- Algorithms and Computation (Q5191683) (← links)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5918725) (← links)
- Improved approximation algorithms for minimum power covering problems (Q5919677) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)