18 citations · 22 across the 17 of their papers we have counts for
24 papers
Approximating Submodular Matroid-Constrained Partitioning
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király +1
The submodular partitioning problem asks to minimize, over all partitions of a ground set , the sum of a given submodular function over the parts of . The problem has…
Cyclic ordering of split matroids
Kristóf Bérczi, Áron Jánosik, Bence Mátravölgyi
There is a long list of open questions rooted in the same underlying problem: understanding the structure of bases or common bases of matroids. These conjectures suggest that matro…
On the Complexity of Inverse Bivariate Multi-unit Assignment Valuation Problems
Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena
Inverse and bilevel optimization problems play a central role in both theory and applications. These two classes are known to be closely related due to the pioneering work of Dempe…
Reconfiguration of basis pairs in regular matroids
Kristóf Bérczi, Bence Mátravölgyi, Tamás Schwarcz
In recent years, combinatorial reconfiguration problems have attracted great attention due to their connection to various topics such as optimization, counting, enumeration, or sam…
Newton-type algorithms for inverse optimization II: weighted span objective
Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena, Kitti Varga
In inverse optimization problems, the goal is to modify the costs in an underlying optimization problem in such a way that a given solution becomes optimal, while the difference be…
Newton-type algorithms for inverse optimization I: weighted bottleneck Hamming distance and -norm objectives
Kristóf Bérczi, Lydia Mirabel Mendoza-Cadena, Kitti Varga
In minimum-cost inverse optimization problems, we are given a feasible solution to an underlying optimization problem together with a linear cost function, and the goal is to modif…