No. | Title | Author | Year |
---|---|---|---|
1 | Almost Tight Approximation Hardness for Single-Source Directed k-Edge-Connectivity | Liao, Chao et al. | 2022 |
2 | On the Approximability of the Traveling Salesman Problem with Line Neighborhoods | Antoniadis, Antonios et al. | 2022 |
3 | On Approximating Degree-Bounded Network Design Problems | Guo, Xiangyu et al. | 2020 |
4 | Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs | Chan, Chun-Hsiang et al. | 2020 |
5 | On the Complexity of Closest Pair via Polar-Pair of Point-Sets | David, Roee et al. | 2018 |
6 | Survivable Network Design for Group Connectivity in Low-Treewidth Graphs | Chalermsook, Parinya et al. | 2018 |
7 | Approximating Directed Steiner Problems via Tree Embedding | Laekhanukit, Bundit | 2016 |
Current Page : | |
Number of result pages: | 1 |
Number of documents: | 7 |