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
| BookMark | eNotj7FOwzAURT3AAIWZ1T-Q8p5fbMzAUFW0RarUBeboJbFFpSSOHFdtNv6hf8iX0IpMd7hXR_fci5sudE6IJ4Q5Yq6fKQdDSs8p14io7sTbou9jOO1bTk6uQxvi-Ptz3hxkis7J_SA9D8lFmb65k528dBJly6fMN-E4PIhbz83gHqecia_V--dyk21364_lYpuxMjZlSLYirSoG7UtH4JU2Dv0ruIrrypIvyxdlfA3GkiI2VAFCXTplNZjrYCbgn3voeh6P3DRFHy-f41ggFFezYjIrJjP6AzCxSQ8 |
|---|---|
| ContentType | Conference Proceeding |
| DBID | ADTOC UNPAY |
| DOI | 10.1145/3406325.3451112 |
| DatabaseName | Unpaywall for CDI: Periodical Content Unpaywall |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| ExternalDocumentID | 10.1145/3406325.3451112 |
| GroupedDBID | ADTOC UNPAY |
| ID | FETCH-LOGICAL-a268t-138c352ca05fbe30f256e1f90ecadc83fbb726fd068323a63c010dbe28506dc83 |
| IEDL.DBID | UNPAY |
| IngestDate | Thu Aug 28 11:06:49 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a268t-138c352ca05fbe30f256e1f90ecadc83fbb726fd068323a63c010dbe28506dc83 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://dl.acm.org/doi/pdf/10.1145/3406325.3451112 |
| ParticipantIDs | unpaywall_primary_10_1145_3406325_3451112 |
| PublicationTitle | Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing |
| Score | 2.3488662 |
| SourceID | unpaywall |
| SourceType | Open Access Repository |
| Title | Approximate Gomory–Hu tree is faster than n – 1 max-flows |
| URI | https://dl.acm.org/doi/pdf/10.1145/3406325.3451112 |
| UnpaywallVersion | publishedVersion |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3BTsJAEIY3BA7GixoxatDswYuH4tJllvbggRiRmEg4SIKnZne7mxBLS4AG8OQ7-IY-ibNQ0RgvHJtOmmaa7T_T7f8NIVfgs1aIrz0PNFMe6rX0FJfgMWtDIwC0UM7g_NQT3UHzcQjDEvG_vTBxgtcZr7fw3ZqexLYA2sINR-3hPtS5Q2q5wcIVAVh_l0ll0Ou3Xwpuzz-R-2QvTydytZBJ8ks8OgcbQ99szRx0_4y81vO5quu3P0TG3e7rkFR_zHq0v5WhI1Iy6TG5bTtW-HKE9aihD9k4m64-3z-6OXWb0HQ0o1Y6QgJ1H85pSvEcbdCxXHo2yRazKhl07p_vul4xKcGTvgjcPPlAYyWlJQOrDGcWCxnTsCEzWsY64Fapli9szAQuYC4F19iGxcr4jlfnAk5IOc1Sc0pooAB7CJBhkwVNJbg0SmFbEViGRxbkGbneJjOabIgY0cbdDFGRiqhIxfkOsTVSnk9zc4ESP1eXxTP9AkEIo4Y |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3BTsJAEIY3BA7GixoxatDswYuH4tJllvbggRiRmEg4SIKnZne7mxBLS4AG8OQ7-IY-ibNQ0RgvHJtOmmaa7T_T7f8NIVfgs1aIrz0PNFMe6rX0FJfgMWtDIwC0UM7g_NQT3UHzcQjDEvG_vTBxgtcZr7fw3ZqexLYA2sINR-3hPtS5Q2q5wcIVAVh_l0ll0Ou3Xwpuzz-R-2QvTydytZBJ8ks8OgcbQ99szRx0_4y81vO5quu3P0TG3e7rkFR_zHq0v5WhI1Iy6TG5bTtW-HKE9aihD9k4m64-3z-6OXWb0HQ0o1Y6QgJ1H85pSvEcbdCxXHo2yRazKhl07p_vul4xKcGTvgjcPPlAYyWlJQOrDGcWCxnTsCEzWsY64Fapli9szAQuYC4F19iGxcr4jlfnAk5IOc1Sc0pooAB7CJBhkwVNJbg0SmFbEViGRxbkGbneJjOabIgY0cbdDFGRiqhIxfkOsTVSnk9zc4ESP1eXxTP9AkEIo4Y |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+53rd+Annual+ACM+SIGACT+Symposium+on+Theory+of+Computing&rft.atitle=Approximate+Gomory%E2%80%93Hu+tree+is+faster+than+n+%E2%80%93+1+max-flows&rft_id=info:doi/10.1145%2F3406325.3451112&rft.externalDocID=10.1145%2F3406325.3451112 |