Minimum cut bases in undirected networks

Given an undirected, connected network G = ( V , E ) with weights on the edges, the cut basis problem is asking for a maximal number of linear independent cuts such that the sum of the cut weights is minimized. Surprisingly, this problem has not attained as much attention as another graph theoretic...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics Jg. 158; H. 4; S. 277 - 290
Hauptverfasser:	Bunke, Florentine, Hamacher, Horst W., Maffioli, Francesco, Schwahn, Anne M.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 28.02.2010
Schlagworte:	Cut basis problem Graph and network algorithms Integer programming Integer programming Graph and network algorithms Cut basis problem
ISSN:	0166-218X, 1872-6771
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!