Folgen
Martin Nägele
Titel
Zitiert von
Zitiert von
Jahr
Submodular minimization under congruency constraints
M Nägele, B Sudakov, R Zenklusen
Combinatorica 39 (6), 1351-1386, 2019
312019
Congruency-constrained TU problems beyond the bimodular case
M Nägele, R Santiago, R Zenklusen
Mathematics of Operations Research, 2023
162023
A new contraction technique with applications to congruency-constrained cuts
M Nägele, R Zenklusen
Mathematical Programming 183, 455-481, 2020
82020
A new dynamic programming approach for spanning trees with chain constraints and beyond
M Nägele, R Zenklusen
Mathematics of Operations Research, 2023
72023
Advances on Strictly -Modular IPs
M Nägele, C Nöbel, R Santiago, R Zenklusen
International Conference on Integer Programming and Combinatorial …, 2023
62023
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
42023
A Better-Than-1.6-Approximation for Prize-Collecting TSP
J Blauth, N Klein, M Nägele
arXiv preprint arXiv:2308.06254, 2023
22023
Efficient Methods for Congruency-Constrained Optimization
M Nägele
ETH Zurich, 2021
12021
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
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–10