2 citations · 2 across the 5 of their papers we have counts for
5 papers
Augmenting a hypergraph to have a matroid-based -bounded -limited packing of rooted hypertrees
Pierre Hoppenot, Zoltán Szigeti
The aim of this paper is to further develop the theory of packing trees in a graph. We first prove the classic result of Nash-Williams \cite{NW} and Tutte \cite{Tu} on packing span…
On arborescence packing augmentation in hypergraphs
Pierre Hoppenot, Zoltán Szigeti
We deepen the link between two classic areas of combinatorial optimization: augmentation and packing arborescences. We consider the following type of questions: What is the minimum…
Matroid-reachability-based decomposition into arborescences
Florian Hörsch, Benjamin Peyrille, Zoltán Szigeti
The problem of matroid-reachability-based packing of arborescences was solved by Király. Here we solve the corresponding decomposition problem that turns out to be more complicated…
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…
A -Approximation Algorithm for the Minimum -Edge Connected Multisubgraph Problem in the Half-Integral Case
S. Boyd, J. Cheriyan, R. Cummings +4
Given a connected undirected graph on vertices, and non-negative edge costs , the 2ECM problem is that of finding a -edge~connected spanning multisubgraph of $\…