MIT
55
Two Problems
l
Packing trees takes too long
»
Gabow runtime is
O
*
(
mc
)
l
Too many trees to check
»
Only claimed that one (of
c
) is good
l
Solution: sampling
