Fast greedy optimal algorithm for hierarchical matching
Leonid Antsfeld, D. Hertz · 2003
In this paper we present a new efficient optimal greedy algorithm for solving a variant of the matching problem. Here, only matchings that are associated with a given hierarchical structure are allowed. We prove the correctness of the proposed algorithm and analyze its computational complexity.