We give a simple algorithm for finding a minimum T-cut. At present, all known efficient algorithms for this problem go through the computation of a Gomory-Hu tree. While our algorithm bases on the same fundamental properties of uncrossing as the previous methods, still it provides an ad-hoc solution. This solution is easier to implement and faster to run. Our results extend to the whole of symmetric submodular functions.
A Simple Minimum T-Cut Algorithm
RIZZI, ROMEO
2003-01-01
Abstract
We give a simple algorithm for finding a minimum T-cut. At present, all known efficient algorithms for this problem go through the computation of a Gomory-Hu tree. While our algorithm bases on the same fundamental properties of uncrossing as the previous methods, still it provides an ad-hoc solution. This solution is easier to implement and faster to run. Our results extend to the whole of symmetric submodular functions.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
