Primal-dual approach for directed vertex connectivity augmentation and generalizations

In their seminal paper, Frank and Jordán [1995] show that a large class of optimization problems, including certain directed graph augmentation, fall into the class of covering supermodular functions over pairs of sets. They also give an algorithm for such problems, however, it relies on the ellipso...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	ACM transactions on algorithms 2008-05, Vol.4 (2), p.1-21
Hauptverfasser:	Veghvegh, Laszlo A, Benczur, Andras A
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!