TY - GEN
T1 - Optimal hypergraph tree-realization
AU - Korach, Ephraim
AU - Razgon, Margarita
PY - 2005/12/1
Y1 - 2005/12/1
N2 - Consider a hyperstar H and a function w assigning a non-negative weight to every unordered pair of vertices of H and satisfying the following restriction: for any three vertices u,v,x such that u and v belong to the same set of hyperedges, ω({u,x}) = ω({v,x}). We provide an efficient method that finds a tree-realization T of H which has the maximum weight subject to the minimum number of leaves. We transform the problem to the construction of an optimal degree-constrained spanning arborescence of a non-negatively weighted directed acyclic graph (DAG). The latter problem is a special case of the weighted matroid intersection problem. We propose a faster method based on finding the maximum weighted bipartite matching.
AB - Consider a hyperstar H and a function w assigning a non-negative weight to every unordered pair of vertices of H and satisfying the following restriction: for any three vertices u,v,x such that u and v belong to the same set of hyperedges, ω({u,x}) = ω({v,x}). We provide an efficient method that finds a tree-realization T of H which has the maximum weight subject to the minimum number of leaves. We transform the problem to the construction of an optimal degree-constrained spanning arborescence of a non-negatively weighted directed acyclic graph (DAG). The latter problem is a special case of the weighted matroid intersection problem. We propose a faster method based on finding the maximum weighted bipartite matching.
UR - http://www.scopus.com/inward/record.url?scp=33744915301&partnerID=8YFLogxK
U2 - 10.1007/11604686_23
DO - 10.1007/11604686_23
M3 - Conference contribution
AN - SCOPUS:33744915301
SN - 3540310002
SN - 9783540310006
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 261
EP - 270
BT - Graph-Theoretic Concepts in Computer Science - 31st International Workshop, WG 2005, Revised Selected Papers
T2 - 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2005
Y2 - 23 June 2005 through 25 June 2005
ER -