Submodular minimization under congruency constraints M Nägele, B Sudakov, R Zenklusen Combinatorica 39 (6), 1351-1386, 2019 | 32 | 2019 |
Congruency-constrained TU problems beyond the bimodular case M Nägele, R Santiago, R Zenklusen Mathematics of Operations Research, 2023 | 17 | 2023 |
An improved approximation guarantee for Prize-Collecting TSP J Blauth, M Nägele Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1848-1861, 2023 | 8 | 2023 |
A new contraction technique with applications to congruency-constrained cuts M Nägele, R Zenklusen Mathematical Programming 183 (1), 455-481, 2020 | 8 | 2020 |
A new dynamic programming approach for spanning trees with chain constraints and beyond M Nägele, R Zenklusen Mathematics of Operations Research, 2023 | 7 | 2023 |
Advances on Strictly -Modular IPs M Nägele, C Nöbel, R Santiago, R Zenklusen International Conference on Integer Programming and Combinatorial …, 2023 | 7 | 2023 |
A better-than-1.6-approximation for prize-collecting TSP J Blauth, N Klein, M Nägele International Conference on Integer Programming and Combinatorial …, 2024 | 6 | 2024 |
Efficient methods for congruency-constrained optimization M Nägele ETH Zurich, 2021 | 1 | 2021 |
A -Approximation Algorithm for Ordered TSP S Armbruster, M Mnich, M Nägele arXiv preprint arXiv:2405.06244, 2024 | | 2024 |
Constrained Submodular Minimisation: From Parity Families to Congruency Constraints M Nägele ETH Zurich, Institute for Operations Research, 2017 | | 2017 |
Refuting a conjecture of Goemans on bounded degree spanning trees S Chestnut, M Nägele, R Zenklusen Operations Research Letters 44 (6), 766-771, 2016 | | 2016 |
A (3/2+/e)-Approximation Algorithm for Ordered TSP S Armbruster, M Mnich, M Nägele | | |