This paper introduces a “weighted” matching algorithm to estimate a robot’s planar displacement by matching twodimensional range scans. The influence of each scan point on ...
Samuel T. Pfister, Kristopher L. Kriechbaum, Sterg...
We present a parallel algorithm for finding a maximum weight matching in general bipartite graphs with an adjustable time complexity of O(n ) using O(nmax(2,4+)) processing
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...