Approximation Algorithms for Steiner and Directed Multicuts

In this paper we consider theSteiner multicutproblem. This is a generalization of the minimum multicut problem where instead of separating nodepairs, the goal is to find a minimum weight set of edges that separates all givensetsof nodes. A set is considered separated if it is not contained in a sing...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of algorithms 1997-02, Vol.22 (2), p.241-269
Hauptverfasser:	Klein, Philip N, Plotkin, Serge A, Rao, Satish, Tardos, Éva
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science control theory systems Exact sciences and technology Information retrieval. Graph Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!