A generalized hypergreedy algorithm for weighted perfect matching

DOI10.1007/BF01989743zbMath0780.68060OpenAlexW1982664392MaRDI QIDQ688623

Bahman Kalantari, Celina Imielinska

Publication date: 31 January 1994

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01989743

zbMATH Keywords

heuristicapproximation algorithmsperfect matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Delaunay graphs are almost as good as complete graphs
• A lower bound to the complexity of Euclidean and rectilinear matching algorithms
• Classes of graphs which approximate the complete Euclidean graph
• Approximate minimum weight matching on points in k-dimensional space
• Heuristic matching for graphs satisfying the triangle inequality
• A new class of heuristic algorithms for weighted perfect matching
• Fast Matching Algorithms for Points on a Polygon
• Paths, Trees, and Flowers

This page was built for publication: A generalized hypergreedy algorithm for weighted perfect matching