On the existence of weak greedy matching heuristics

Authors:
M.D Grigoriadis;B Kalantari;C.Y Lai
Affiliations:
Department of Computer Science, Rutgers University, New Brunswick, NJ 08903, USA;Department of Computer Science, Rutgers University, New Brunswick, NJ 08903, USA;Department of Computer Science, Rutgers University, New Brunswick, NJ 08903, USA
Venue:
Operations Research Letters
Year:
1986

Citing 4
Cited 0

A lower bound to the complexity of Euclidean and rectilinear matching algorithms

Information Processing Letters
Assignment and Matching Problems: Solution Methods with FORTRAN-Programs

Assignment and Matching Problems: Solution Methods with FORTRAN-Programs
Heuristics for weighted perfect matching

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.