1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2026
The Bidirected Cut Relaxation for Steiner Tree: Better Integrality Gap Bounds and the Limits of Moat Growing
Paul Paschmanns, Vera Traub
The Steiner Tree problem asks for the cheapest way of connecting a given subset of the vertices in an undirected graph. One of the most prominent linear programming relaxations for…
cs.DS2024★ 1 cited
The Days On Days Off Scheduling Problem
Fabien Nießen, Paul Paschmanns
Personnel scheduling problems have received considerable academic attention due to their relevance in various real-world applications. These problems involve preparing feasible sch…