1 citations · 2 across the 19 of their papers we have counts for
5 papers · 1 filter
On the complexity of packing rainbow spanning trees
Kristóf Bérczi, Gergely Csáji, Tamás Király
One of the most important questions in matroid optimization is to find disjoint common bases of two matroids. The significance of the problem is well-illustrated by the long list o…
On approximating the rank of graph divisors
Kristóf Bérczi, Hung P. Hoang, Lilla Tóthmérész
Baker and Norine initiated the study of graph divisors as a graph-theoretic analogue of the Riemann-Roch theory for Riemann surfaces. One of the key concepts of graph divisor theor…
Manipulating the outcome of stable matching and roommates problems
Kristóf Bérczi, Gergely Csáji, Tamás Király
The stable marriage and stable roommates problems have been extensively studied due to their high applicability in various real-world scenarios. However, it might happen that no st…
Hypergraph characterization of split matroids
Kristóf Bérczi, Tamás Király, Tamás Schwarcz +2
We provide a combinatorial study of split matroids, a class that was motivated by the study of matroid polytopes from a tropical geometry point of view. A nice feature of split mat…
Efficient Approximations for Many-Visits Multiple Traveling Salesman Problems
Kristóf Bérczi, Matthias Mnich, Roland Vincze
A fundamental variant of the classical traveling salesman problem (TSP) is the so-called multiple TSP (mTSP), where a set of salesmen jointly visit all cities from a set of …