Sciweavers

455 search results - page 6 / 91
» A local approximation algorithm for maximum weight matching
Sort
View
ICRA
2002
IEEE
94views Robotics» more  ICRA 2002»
14 years 9 days ago
Weighted Range Sensor Matching Algorithms for Mobile Robot Displacement Estimation
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...
IPL
2006
139views more  IPL 2006»
13 years 7 months ago
An adjustable linear time parallel algorithm for maximum weight bipartite matching
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
Morteza Fayyazi, David R. Kaeli, Waleed Meleis
JCO
2010
169views more  JCO 2010»
13 years 5 months ago
An almost four-approximation algorithm for maximum weight triangulation
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...
Shiyan Hu
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
13 years 7 months ago
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties
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...
Dániel Marx, Ildikó Schlotter