No. | Title | Author | Year |
---|---|---|---|
1 | Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems | Chekuri, Chandra et al. | 2021 |
2 | Faster Algorithms for Rooted Connectivity in Directed Graphs | Chekuri, Chandra et al. | 2021 |
3 | Isolating Cuts, (Bi-)Submodularity, and Faster Algorithms for Connectivity | Chekuri, Chandra et al. | 2021 |
4 | Online Directed Spanners and Steiner Forests | Grigorescu, Elena et al. | 2021 |
5 | Fast and Deterministic Approximations for k-Cut | Quanrud, Kent | 2019 |
6 | Approximating Optimal Transport With Linear Programs | Quanrud, Kent | 2018 |
7 | LP Relaxation and Tree Packing for Minimum k-cuts | Chekuri, Chandra et al. | 2018 |
Current Page : | |
Number of result pages: | 1 |
Number of documents: | 7 |