TY - INPR
A1 - Perez Tchernov, Alexander J.
A1 - Schwahn, Anne M.
T1 - New heuristics for the minimum fundamental cut basis problem
N2 - Given an undirected connected network and a weight function finding a basis of the cut space with minimum sum of the cut weights is termed Minimum Cut Basis Problem. This problem can be solved, e.g., by the algorithm of Gomory and Hu [GH61]. If, however, fundamentality is required, i.e., the basis is induced by a spanning tree T in G, the problem becomes NP-hard. Theoretical and numerical results on that topic can be found in Bunke et al. [BHMM07] and in Bunke [Bun06]. In the following we present heuristics with complexity O(m log n) and O(mn), where n and m are the numbers of vertices and edges respectively, which obtain upper bounds on the aforementioned problem and in several cases outperform the heuristics of Schwahn [Sch05].
T3 - Report in Wirtschaftsmathematik (WIMA Report) - 112
KW - minimum fundamental cut basis
KW - fundamental cut
KW - cut
KW - heuristic
KW - algorithm
KW - data structure
KW - NP
Y1 - 2007
UR - https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1887
UR - https://nbn-resolving.org/urn:nbn:de:hbz:386-kluedo-15041
ER -