Approximate Gomory–Hu tree is faster than n – 1 max-flows
Saved in:
| Published in | Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing |
|---|---|
| Format | Conference Proceeding |
| Language | English |
| Online Access | Get full text |
| DOI | 10.1145/3406325.3451112 |
Cover
| DOI: | 10.1145/3406325.3451112 |
|---|