- Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree
Description
- Title: Breaching the 2-approximation barrier for connectivity augmentation: a reduction to Steiner tree
- Collective work title: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2020)
- Creator: Byrka, Jarosław ; Grandoni, Fabrizio ; Ameli, Afrouz
- Pages: S. 815-825
- Description: Materials of 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2020), Chicago, USA, 22-26.06.2020.
- Publisher: ACM
- Place of publishing: New York
- Date issued: 2020
- Type: Tekst
- Identifier: ISBN 9781450369794 ; https://doi.org/10.1145/3357713.3384301
- Language: eng
- Has version: https://doi.org/10.1145/3357713.3384301
- Detailed object type: rozdz
- Object type: Rozdział