scientific article; zbMATH DE number 4045188

MaRDI QIDQ3782810zbMATH OpenFDO

Authors

Publication date 1987

zbMATH Keywords

complete graphsgreedy heuristicminimum-weight perfect matchingtime complexities

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the existence of weak greedy matching heuristics
• A generalized hypergreedy algorithm for weighted perfect matching
• Heuristic matching for graphs satisfying the triangle inequality
• A new class of heuristic algorithms for weighted perfect matching
• A general class of heuristics for minimum weight perfect matching and fast special cases with doubly and triply logarithmic errors

Cited in

(13)

• On the existence of weak greedy matching heuristics
• A general class of heuristics for minimum weight perfect matching and fast special cases with doubly and triply logarithmic errors
• Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
• New primal and dual matching heuristics
• Worst-case greedy matchings in the unitd-cube
• A survey of heuristics for the weighted matching problem
• Heuristic matching for graphs satisfying the triangle inequality
• Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching
• scientific article; zbMATH DE number 4025481 (Why is no real title available?)
• A new class of heuristic algorithms for weighted perfect matching
• Greedy matching: guarantees and limitations
• Solving a "Hard" problem to approximate an "Easy" one
• A generalized hypergreedy algorithm for weighted perfect matching

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3782810)