Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4950854 | Information Processing Letters | 2017 | 5 Pages |
Abstract
In this note we give a short and relatively simple algorithmic proof of a theorem of Benczúr and Frank on covering a symmetric crossing supermodular function with a minimum number of graph edges. Our proof method also implies a deficient form of the theorem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Attila Bernáth,