Pages that link to "Item:Q3088103"

The following pages link to Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems (Q3088103):

Displaying 2 items.

• New approximation algorithms for the rooted budgeted cycle cover problem (Q5918725) (← links)
• Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)