Preprint
Oct 2026
Packing Diverse Shortest Cycles
Bentert, Fomin, Golovach, Korhonen, Lochet, Panolan, Ramanujan, Saurabh, and Simonov (SODA 2025) initiated the parameterized study of Edge-Disjoint Shortest Cycle Packing: given a weighted graph $G$ and an integer $k$, decide whether $G$ contains $k$ edge-disjoint cycles of minimum weight. They showed that the problem...
A. Agrawal, Fedor V. Fomin, P. Golovach et al.
· 0 citations