On the existence of weak greedy matching heuristics

DOI10.1016/0167-6377(86)90078-7zbMath0601.05038OpenAlexW1987379377MaRDI QIDQ1080871

B. George

Publication date: 1986

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(86)90078-7

zbMATH Keywords

complexityheuristicsapproximate algorithmsminimum weight perfect matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• A lower bound to the complexity of Euclidean and rectilinear matching algorithms
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Linear-time approximation algorithms for finding the minimum-weight perfect matching on a plane
• A survey of heuristics for the weighted matching problem
• Heuristic matching for graphs satisfying the triangle inequality
• Decomposable searching problems I. Static-to-dynamic transformation
• On a Greedy Heuristic for Complete Matching
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: On the existence of weak greedy matching heuristics