Martin Nägele

MaRDI QIDQ2196310zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A better-than-1.6-approximation for prize-collecting TSP Mathematical Programming. Series A. Series B	2026-05-08	Paper
A (3/2+1/e)-approximation algorithm for ordered TSP	2025-10-06	Paper
Advances on strictly -modular IPs Mathematical Programming. Series A. Series B	2025-03-05	Paper
A better-than-1.6-approximation for prize-collecting TSP	2025-02-07	Paper
A new dynamic programming approach for spanning trees with chain constraints and beyond Mathematics of Operations Research	2025-01-28	Paper
Congruency-constrained TU problems beyond the bimodular case Mathematics of Operations Research	2024-11-07	Paper
Congruency-constrained TU problems beyond the bimodular case	2024-07-19	Paper
An improved approximation guarantee for prize-collecting TSP	2024-05-08	Paper
Advances on strictly \(\varDelta \)-modular IPs Integer Programming and Combinatorial Optimization	2023-11-09	Paper
A new contraction technique with applications to congruency-constrained cuts Mathematical Programming. Series A. Series B	2020-08-28	Paper
Submodular minimization under congruency constraints Combinatorica	2020-02-26	Paper
A new contraction technique with applications to congruency-constrained cuts Integer Programming and Combinatorial Optimization	2020-02-06	Paper
A new dynamic programming approach for spanning trees with chain constraints and beyond Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms	2019-10-15	Paper
Refuting a conjecture of goemans on bounded degree spanning trees Operations Research Letters	2019-01-15	Paper
Submodular minimization under congruency constraints	2018-03-15	Paper

Research outcomes over time

This page was built for person: Martin Nägele