Advertisement

Optimal Hypergraph Tree-Realization

  • Ephraim Korach
  • Margarita Razgon
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3787)

Abstract

Consider a hyperstar H and a function ω 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.

Keywords

Linear Order Directed Acyclic Graph Unordered Pair Bipartite Match Current Match 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. Journal of the ACM 30, 479–513 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Brezovec, C., Cornuejols, G., Glover, F.: Two algorithms for weighted matroid intersection. Mathematical Programming, Series A 36, 39–53 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)zbMATHGoogle Scholar
  4. 4.
    Korach, E., Stern, M.: The clustering matroid and the optimal clustering tree. Mathematical Programming, Series B 98(1-3), 385–414 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    McKee, T., McMorris, F.: Topics in Interesection Graph Theory. Siam Monographs on Discrete Mathematics and Applications (1999)Google Scholar
  6. 6.
    Recski, A.: Matroid Theory and its Applications in Electric Network Theory and in Statics. Springer, Heidelberg (1989)Google Scholar
  7. 7.
    Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)zbMATHGoogle Scholar
  8. 8.
    Swaminathan, R., Wagner, D.: On the consecutive-retrieval problem. SIAM Journal of Computing 23(2), 398–414 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Tarjan, R., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal of Computing 13, 566–579 (1984)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Ephraim Korach
    • 1
  • Margarita Razgon
    • 1
  1. 1.Department of Industrial Engineering and ManagementBen-Gurion University of the NegevBeer-ShevaIsrael

Personalised recommendations