| Approaching 3/2 for the s-t-path TSP V Traub, J Vygen Journal of the ACM (JACM) 66 (2), 1-17, 2019 | 45 | 2019 |
| An improved approximation algorithm for the asymmetric traveling salesman problem V Traub, J Vygen SIAM Journal on Computing 51 (1), 139-173, 2022 | 44* | 2022 |
| Bridging the gap between tree and connectivity augmentation: unified and stronger approaches F Cecchetto, V Traub, R Zenklusen Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 40 | 2021 |
| Local search for weighted tree augmentation and steiner tree V Traub, R Zenklusen Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 38 | 2022 |
| Reducing path TSP to TSP V Traub, J Vygen, R Zenklusen Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 38 | 2020 |
| Global routing with timing constraints S Held, D Müller, D Rotter, R Scheifele, V Traub, J Vygen IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2017 | 37 | 2017 |
| A better-than-2 approximation for weighted tree augmentation V Traub, R Zenklusen 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 1-12, 2022 | 36 | 2022 |
| Improving the approximation ratio for capacitated vehicle routing J Blauth, V Traub, J Vygen Mathematical Programming 197 (2), 451-497, 2023 | 23 | 2023 |
| A (1.5+ ε)-approximation algorithm for weighted connectivity augmentation V Traub, R Zenklusen Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1820-1833, 2023 | 14 | 2023 |
| Breaching the 2-approximation barrier for the forest augmentation problem F Grandoni, AJ Ameli, V Traub Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 13 | 2022 |
| Beating the Integrality Ratio for --Tours in Graphs V Traub, J Vygen SIAM Journal on Computing 52 (6), FOCS18-37-FOCS18-84, 2020 | 11 | 2020 |
| Global routing with inherent static timing constraints S Held, D Müller, D Rotter, V Traub, J Vygen 2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), 102-109, 2015 | 11 | 2015 |
| Layers and matroids for the traveling salesman’s paths F Schalekamp, A Sebő, V Traub, A Van Zuylen Operations Research Letters 46 (1), 60-63, 2018 | 9 | 2018 |
| An improved upper bound on the integrality ratio for the s–t-path TSP V Traub, J Vygen Operations Research Letters 47 (3), 225-228, 2019 | 8 | 2019 |
| The asymmetric traveling salesman path LP has constant integrality ratio A Köhne, V Traub, J Vygen Mathematical Programming 183 (1), 379-395, 2020 | 7 | 2020 |
| Improving on Best-of-Many-Christofides for T-tours V Traub Operations Research Letters 48 (6), 798-804, 2020 | 6 | 2020 |
| Approximation algorithms for traveling salesman problems V Traub Universitäts-und Landesbibliothek Bonn, 2020 | 5 | 2020 |
| A fast -approximation algorithm for capacitated cycle covering V Traub, T Tröbst Mathematical Programming 192 (1), 497-518, 2022 | 4 | 2022 |
| Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks J Blauth, S Held, D Müller, N Schlomberg, V Traub, T Tröbst, J Vygen arXiv preprint arXiv:2205.00889, 2022 | 1 | 2022 |
| Cost Allocation for Set Covering: the Happy Nucleolus J Blauth, A Ellerbrock, V Traub, J Vygen arXiv preprint arXiv:2401.04040, 2024 | | 2024 |
Jens VygenProfessor of Discrete Mathematics, University of BonnVerified email at or.uni-bonn.de
