论文信息 - On the existence of weak greedy matching heuristics

On the existence of weak greedy matching heuristics

We exhibit an exponential number of greedy heuristics for minimum weight perfect matching of complete graphs of n vertices with edge weights satisfying the triangle inequality. The ratio of the weight of an approximate solution obtained by these heuristics to that of an optimal solution is shown to be bounded above by finite valued functions which depend only on n.

Michael D. Grigoriadis | Bahman Kalantari | C. Y Lai

[1] Robert E. Tarjan,et al. On a Greedy Heuristic for Complete Matching , 1981, SIAM J. Comput..

[2] Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[3] Leonidas J. Guibas,et al. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[4] David Avis,et al. A survey of heuristics for the weighted matching problem , 1983, Networks.

[5] Edward M. Reingold,et al. Heuristics for weighted perfect matching , 1980, STOC '80.

[6] Michael D. Grigoriadis,et al. A Lower Bound to the Complexity of Euclidean and Rectilinear Matching Algorithms , 1986, Inf. Process. Lett..

[7] Kazuo Murota,et al. Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a Plane , 1981, Inf. Process. Lett..

[8] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[9] David A. Plaisted. Heuristic Matching for Graphs Satisfying the Triangle Inequality , 1984, J. Algorithms.

[10] R. Burkard,et al. Assignment and Matching Problems: Solution Methods with FORTRAN-Programs , 1980 .

[11] Jon Louis Bentley,et al. Decomposable Searching Problems I: Static-to-Dynamic Transformation , 1980, J. Algorithms.