4 papers
A simplified min-max formula for the inverse arborescence problem
András Frank, Hanna Szabrina Horváth
A simple min-max theorem is formulated and proved for the smallest modification (measured in -norm) of an input cost function that makes a target arborescence of a…
A new approach to bipartite stable matching optimization
Tamás Fleiner, András Frank, Tamás Király
As a common generalization of previously solved optimization problems concerning bipartite stable matchings, we describe a strongly polynomial network flow based algorithm for comp…
How to see the forest despite the trees
Erika Bérczi-Kovács, András Frank
One of the major starting points of discrete optimization is the theorem of Nash-Williams and Tutte on the existence of disjoint spanning trees of a graph, along with its count…
Prefix-bounded matrices
Nóra A. Borsik, András Frank, Péter Madarasi +1
By unifying various earlier extensions of alternating sign matrices (ASMs), we introduce the notion of prefix-bounded matrices (PBMs). It is shown that the convex hull of these mat…