Scheduling Out-Trees Online to Optimize Maximum Flow
Saved in:
| Published in | Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures |
|---|---|
| Format | Conference Proceeding |
| Language | English |
| Online Access | Get full text |
| DOI | 10.1145/3626183.3659955 |
Cover
| BookMark | eNotz7FOwzAUhWEPMJTC3NUvkHJtJ449oooCUlEGymw5uTdgyXGiNFEpTw-ITEf6hyN9N-wq9YkY2wjYCpEX90pLLYzaKl1YWxQrlr81n4RzDOmDV_OUHUeiE6_SbyA-9bwaptCFb-Kv_it0c8f3sT_fsuvWxxPdLbtm7_vH4-45O1RPL7uHQ-alNlOmSCHkZCwWRiKUUqJsEWoB1HiwuSrbRgusUXo02IBVYInKUgpL3kOt1gz-f-c0-MvZx-iGMXR-vDgB7g_kFpBbQOoHWztE7w |
|---|---|
| ContentType | Conference Proceeding |
| DBID | ADTOC UNPAY |
| DOI | 10.1145/3626183.3659955 |
| 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/3626183.3659955 |
| GroupedDBID | ADTOC UNPAY |
| ID | FETCH-LOGICAL-a268t-3e3d04e89d582d0722d2fd0b10eca09437fc61dbd2ad8dc09309ee77219eaa0b3 |
| IEDL.DBID | UNPAY |
| IngestDate | Sun Sep 07 11:28:27 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| License | cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a268t-3e3d04e89d582d0722d2fd0b10eca09437fc61dbd2ad8dc09309ee77219eaa0b3 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://doi.org/10.1145/3626183.3659955 |
| ParticipantIDs | unpaywall_primary_10_1145_3626183_3659955 |
| PublicationTitle | Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures |
| Score | 1.8766612 |
| SourceID | unpaywall |
| SourceType | Open Access Repository |
| Title | Scheduling Out-Trees Online to Optimize Maximum Flow |
| URI | https://doi.org/10.1145/3626183.3659955 |
| UnpaywallVersion | publishedVersion |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEA3aHsSLihUVlRy8eEjNZjcfexSxFMG2YAv1tGQ3s1Jsd0vdpdpfb-KutYgHvc1hIOHNMBPImzcIXcrQAPdAE7dhlNgMSYhKREqYMVLSEOyD7pNt0RPdUXA_5uNaJMnNwmz-33sBv3ZqKTbr2r5wylh8GzWtIWgDNUe9wc1TLdbzi-cu2imzuX5f6ul0o2N09lD366yKKPLSLou4nax-yDD-4TL7qPU9locH64ZzgLYgO0TBo4XdOD75M-6XBRkuAF5xpSCKixz3bU2YTVaAH_TbZFbOcGeaL1to1Lkb3nZJvQqBaCZUQXzwDQ1AhYYrZqhkzLDU0NijkGhHDpRpIjwTG6aNMgkNfYuzA9oLQWsa-0eokeUZHCOcOsU0JUIegLBVMlXMxhG4tVgqYy1P0NUauGheSV5E1fgyj2oEohqB03_4nqFGsSjh3PbwIr6o4_cBSVCYMw |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEA3aHsSLihUVlRy8eEjNZjcfexSxFMG2YAv1tGQ3s1Jsd0vdpdpfb-KutYgHvc1hIOHNMBPImzcIXcrQAPdAE7dhlNgMSYhKREqYMVLSEOyD7pNt0RPdUXA_5uNaJMnNwmz-33sBv3ZqKTbr2r5wylh8GzWtIWgDNUe9wc1TLdbzi-cu2imzuX5f6ul0o2N09lD366yKKPLSLou4nax-yDD-4TL7qPU9locH64ZzgLYgO0TBo4XdOD75M-6XBRkuAF5xpSCKixz3bU2YTVaAH_TbZFbOcGeaL1to1Lkb3nZJvQqBaCZUQXzwDQ1AhYYrZqhkzLDU0NijkGhHDpRpIjwTG6aNMgkNfYuzA9oLQWsa-0eokeUZHCOcOsU0JUIegLBVMlXMxhG4tVgqYy1P0NUauGheSV5E1fgyj2oEohqB03_4nqFGsSjh3PbwIr6o4_cBSVCYMw |
| 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+36th+ACM+Symposium+on+Parallelism+in+Algorithms+and+Architectures&rft.atitle=Scheduling+Out-Trees+Online+to+Optimize+Maximum+Flow&rft_id=info:doi/10.1145%2F3626183.3659955&rft.externalDocID=10.1145%2F3626183.3659955 |