activity
20202024
most citedA -Approximation Algorithm for the Minimum -Edge Connected Multisubgraph Problem in the Half-Integral Case

2 citations · 2 across the 5 of their papers we have counts for

collaborators
Showing 2023Show all

1 paper · 1 filter

math.CO2023

Regular packing of rooted hyperforests with root constraints in hypergraphs

Pierre Hoppenot, Mathis Martin, Zoltán Szigeti

The seminal papers of Edmonds \cite{Egy}, Nash-Williams \cite{NW} and Tutte \cite{Tu} have laid the foundations of the theories of packing arborescences and packing trees. The dire…