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...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 158; no. 4; pp. 277 - 290
Main Authors:	Bunke, Florentine, Hamacher, Horst W., Maffioli, Francesco, Schwahn, Anne M.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 28.02.2010
Subjects:	Cut basis problem Graph and network algorithms Integer programming Integer programming Graph and network algorithms Cut basis problem
ISSN:	0166-218X, 1872-6771
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!