Approximate Gomory–Hu tree is faster than n – 1 max-flows (Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing)