| No. | Title | Author | Year |
|---|---|---|---|
| 1 | On the Computational Tractability of a Geographic Clustering Problem Arising in Redistricting | Cohen-Addad, Vincent et al. | 2021 |
| 2 | Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension | Becker, Amariah et al. | 2018 |
| 3 | A Quasi-Polynomial-Time Approximation Scheme for Vehicle Routing on Planar and Bounded-Genus Graphs | Becker, Amariah et al. | 2017 |
| 4 | Engineering an Approximation Scheme for Traveling Salesman in Planar Graphs | Becker, Amariah et al. | 2017 |
| 5 | Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221) | Erickson, Jeff et al. | 2016 |
| 6 | Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs | Klein, Philip N. et al. | 2015 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 6 |