|
In [19] and [16], L. Lovász proved some classic min-max theorems of graph theory by inventing basic techniques to handle submodular functions. In this paper, we want to demonstrate that these ideas are alive after thirty years of their birth.
Bibtex entry:
| AUTHOR | = | {B{\'e}rczi, Krist{\'o}f and Frank, Andr{\'a}s}, |
| TITLE | = | {Variations For Lovász' Submodular Ideas}, |
| NOTE | = | {{\tt egres.elte.hu}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2008}, |
| NUMBER | = | {TR-2008-07} |