| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Faster (1+ε)-Approximation for Unsplittable Flow on a Path via Resource Augmentation and Back | Grandoni, Fabrizio et al. | 2021 |
| 2 | Breaking the Barrier of 2 for the Storage Allocation Problem | Mömke, Tobias et al. | 2020 |
| 3 | A QPTAS for Gapless MEC | Garg, Shilpa et al. | 2018 |
| 4 | Approximating Airports and Railways | Adamaszek, Anna et al. | 2018 |
| 5 | Airports and Railways: Facility Location Meets Network Design | Adamaszek, Anna et al. | 2016 |
| 6 | Complexity and Approximability of Parameterized MAX-CSPs | Dell, Holger et al. | 2015 |
| 7 | Robust Reoptimization of Steiner Trees | Goyal, Keshav et al. | 2015 |
| 8 | Randomized Online Algorithms with High Probability Guarantees | Komm, Dennis et al. | 2014 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |