Chandra R. Chegireddy

Learn More
In the K-best perfect matching problem (KM) one wants to find K pairwise different, perfect matchings M,, . . . . Mk such that w(M,)? w(Mz) ?...z w(Mk)? w(M), vA4#M,, M2, . . . . Mk. The procedure discussed in this paper is based on a binary partitioning of the matching solution space. We survey different algorithms to perform this partitioning. The best(More)
  • 1